Loyola College in Maryland
CS 301 - Data Structures and Algorithms I
Fall 2003
Loyola College >
Department of Computer Science >
CS 301 >
Homework >
Homework 17
Due
Friday, November 7 at the beginnging of class
Problems
1. 8.8
2. The partition function of quicksort could be changed as follows: To place the leftmost value in the correct location, count the number of values that are strictly less than the leftmost value. The resulting number is the correct index for the desired value. Exchange the leftmost value for the value at the indexed location. With all other code left as it is, does this support a correctly functioning quicksort? If not, explain why.