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


Class 26: More Efficient Sorting Algorithms

Back to Sorting Algorithms. On to Project Discussion.

Held Friday, October 8, 1999

Overview

Today we continue our discussion of sorting by visiting some more efficient sorting algorithms that use divide and conquer as their underlying design strategy.

Notes

Contents

Handouts

Summary


Sorting with Divide and Conquer

Merge Sort

Running Time

Running Time, Revisited

A Problem

Other Versions

Quicksort

Variations

Better Sorting Techniques


History

Tuesday, 10 August 1999

Wednesday, 6 October 1999

Thursday, 7 October 1999

Friday, 8 October 1999

Back to Sorting Algorithms. On to Project Discussion.


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 http://www.math.grin.edu/~rebelsky/Courses/CS152/99F/Outlines/outline.26.html

Source text last modified Fri Oct 8 08:58:26 1999.

This page generated on Fri Oct 8 08:58:52 1999 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu