Fall 2002 CSCI 333 Homework 4 Solution

Problem 1

Show the comparisions and exchanges made by the bad sorts, selection, insertion, and bubble, on the following input set of six values:

1. 3
2. 7
3. 15
4. 13
5. 2
6. 5

Problem 2

Show how quicksort will partition the following array of nine values into two parts. Show the exchange and comparisions made in the partitioning. You may choose the pivot.

1. 3
2. 19
3. 7
4. 13
5. 15
6. 2
7. 17
8. 5
9. 23

We're going to choose the middle element, 15, as the pivot.

Problem 3

Show how the good sorts, shellsort, heapsort, and mergesort will sort the following list of eight values.

1. 3
2. 7
3. 15
4. 20
5. 13
6. 10
7. 2
8. 5

Since insertion sort beats the O(n log n) sorts for small data sets, in our examples we'll assumer we're using insertion sort where there are only four unsorted elements remain.