Lab: Merge sort

Assigned
Tuesday, 15 December 2020
Summary
In this laboratory, we explore issues relating to the merge sort divide-and-conquer algorithm for sorting.

Preparation

a. Decide which partner will be Side A and which partner will be Side B.

b. Grab your respective code files

c. Review any provided code at the top of the file to see what is new. You should feel free to quickly experiment with any new procedures, but we’ll also be looking at most of them in the lab.

Acknowledgements

This lab was created in Fall 2020 as a hybrid of a wide variety of prior labs on binary trees.

Copyright © Charlie Curtsinger, Sarah Dahlby Albright, Janet Davis, Fahmida Hamid, Titus Klinge, Peter-Michael Osera, Samuel A. Rebelsky, and Jerod Weinman. Selected materials are copyright by John David Stone or Henry Walker and are used with permission.

Unless specified otherwise elsewhere on this page, this work is licensed under a Creative Commons Attribution 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc/3.0/ or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.

This website was built using Jekyll, Twitter Bootstrap, and the Bootswatch Cosmo Theme.