Fundamentals of Computer Science II (CSC-152 2000F)

Class 29: More Efficient Sorting Algorithms

Back to Some Sorting Algorithms. On to Quicksort.

Held Friday, October 13, 2000


Today we visit our first divide-and-conquer sorting algorithm, merge sort.



Sorting with Divide and Conquer

Merge Sort

Running Time

Running Time, Revisited

A Problem

Other Versions

Splitting via Size


Wednesday, 23 August 2000

Thursday, 24 August 2000

Monday, 24 October 2000

Back to Some Sorting Algorithms. On to Quicksort.

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 Wed Oct 25 10:05:37 2000.

This page generated on Fri Oct 27 08:20:01 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at