Lecture 9

Learning objectives

After this class, you should be able to:

1. Given an array of digits, and the range for the digits, show how counting sort will sort them.
2. Given an array of numbers containing d digits in {0, 1, ..., k} each, show how radix sort will sort them.
3. Given an array of numbers, show how bucket sort will sort them.
4. Derive the time complexity of counting sort and radix sort.
5. Prove the correctness of radix sort and counting sort.

Reading assignment

1. Lectures 6-9 slides.
2. CLR: Sections 8.2 - 8.4.

Exercises and review questions

• Questions on current lecture's material
  1. Exercise 8.2-1.
  2. Exercise 8.2-3.
  3. Exercise 8.3-1.
  4. Exercise 8.3-2.
  5. Exercise 8.3-3.
  6. Exercise 8.4-1.

• Questions on next lecture's material
  1. None.