COSC 350: Data Structures
April 6, 2009

More Sorting

Shell Sort (Diminishing Increment Sort): gap with insertion sort

Quick Sort: Piviot

Merge Sort: Recursive, Memory use

Homework

Routine Homework: Wednesday (April 8)

Sort the data [8, 4, 2, 9, 3, 0, 7, 1, 6, 5] :

1. Using bubble sort showing the data after each complete pass.
2. Using insertion sort showing the data after each insertion pass.
3. Using selection sort showing the data after each exchange.
4. Using quick sort showing the data after each exchange.
5. Using shell sort with a gap of 4 showing the data after sorting for each gap pass.
6. Sketch out how the data would be sorted using merge sort.

Sorting Project: Wednesday (April 15)

This page was created by Joe Sloan.
It was last modified on or after: 6 April 2009
Send mail to: sloanjd@wofford.edu