CSC 2400, Spring 2009
Chapter 5 Practice Problems
Assigned March 26, 2009

Exercises 5.1 #1, #2 in 1st edition (design a recursive decrease-by-one algorithm for finding the position of the smallest item in an array of n numbers,
determine its time efficiency, and compare it to the efficiency of the brute-force algorithm for the same problem)
Exercises 5.2 #1, #4, #7, #8, #10
Exercises 5.3 #1 (You may use the BFS-based algorithm if you wish), #2b, #9
Exercises 5.5 #1, #2, #4, #6

Don't forget about the hints in the back of the book!