Fundamentals of Computer Science I (CSC-151.02 2000F)

Class 47: Sorting with Divide and Conquer

Back to Sorting Lab. On to Merge Sort Lab.

Held Tuesday, November 21, 2000


Today we revisit the question of sorting by considering some sorting algorithms that are typically more efficient than insertion sort. These algorithms depend on the divide and conquer strategy that we used so successfully in binary search.




Merge Sort

Quick Sort

Coding Merge Sort


Thursday, 24 August 2000

Tuesday, 21 November 2000

Back to Sorting Lab. On to Merge Sort Lab.

Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at

Source text last modified Tue Nov 21 08:48:18 2000.

This page generated on Tue Nov 21 08:58:02 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at