CIS 11: Data Structures & Algorithms

Project L

Implement and test the quicksort function. This simple implementation will sort an array of integers and follow the pseudocode from Chapter 13.

• You will test your implementation by including your function in the program demonstrated in class. It is available here.
• You should verify the correctness of your function for each scenario. The program will display the first 101 elements of the sorted array if the quick sort was used.

When you're satisfied with the implementation, submit your work via the CATE form for Project L.

2006/05/20