# Fall 2001 CSCI 333 Homework 5

This assignment is due Wednesday, 24 October.

## Problem 1

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

- 3
- 7
- 15
- 13
- 2
- 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.

- 3
- 19
- 7
- 13
- 15
- 2
- 17
- 5
- 23

## Problem 3

Show how heapsort will sort the following list of six values.

- 3
- 7
- 15
- 13
- 2
- 5