COP 4531: Lecture 15

Learning objectives

After this class, you should be able to:

1. Given an array A and an index i, show the steps executed by the deterministic SELECT algorithm to find the i th smallest element of A.
2. Analyze the running time of the SELECT algorithm.
3. Given problems similar to selection, develop efficient algorithms and derive their time complexities.

Reading assignment

1. CLR: Section 9.3.
2. CLR: Chapter 15, page 332.

Exercises and review questions

• Questions on current lecture's material
  1. Write C/C++ code implementing the SELECT algorithm.
  2. Exercise 9.3-1.
  3. Exercise 9.3-3.

• Questions on next lecture's material
  1. (Post your solution on the discussion board) Give an example of a 3 x 3 matrix and a 3 x 2 matrix, and give their product.