CS421 - Advanced Data Structures and Algorithm Development - Week 11 & 12 Assignment

(Homework must be submitted electronically to summers_wayne@ColumbusState.edu or hand delivered to my mailbox by noon MST. )
Late assignments will be subject to up to a 25% deduction in points per day. No credit will be given for assignments that are more than one week late.

DUE April 14, 1999 (12 pts)
1. Swap Sorts
   1. Evaluate (n 2) / 2 [This is the average number of swaps for Bubble Sort)
   2. Answer the pause on the bottom of page 237.
   3. Trace algorithm 4.12 on pg. 289 for the following data and then answer the question 6(a-f) on page 288.
2. DUE April 19, 1999 (6 pts)
   For the following data 2 3 8 1 6 5
   1. Trace the linear insert sort.
   2. Trace the Select sort.
   3. Trace the Heap sort.

3. DUE April 23, 1999 (8 pts)
   For the following data 2 3 8 1 6 5
   1. Trace the merge sort.
   2. Trace the quick sort.
   3. Exercise #20 on page 291.
   4. EXTRA CREDIT: Exercise #4 on page 288.

4. Participate in the Collabra discussion group (CS421 on the server cs.nmhu.edu). Discuss sorting techniques.