CS 2401 Quiz #3

Date: Monday, June 25, 2012.

1. Which topics are covered in the chapter that you were supposed to read for this class (mark Y/N):

2. What is O(n)? Briefly explain your answer.

3. Show, step by step, how binary search will find an element 3.2 in the array {0.1,2.1,2.5,3.2, 3.3,4.6,10.1, 32.0}. No code is needed.