quickSort

Assignment:

1. Create a quickSort algorithm in your sorting template program and count the number of steps needed for quickSort. Record the number of steps in Lab Assignment, A17.1, QuadSort.

2. Graph the number of steps of the three quadratic sorts (bubble, selection, insertion) and the recursive mergeSort and quickSort on the same piece of graph paper. Plot the number of steps on the vertical axis and number of data elements on the horizontal axis. It will be difficult to graph the more efficient algorithms, because the number of steps is so much smaller than the quadratic algorithms. Make an estimate of where the data points occur for recursive mergeSort and quickSort.

Instructions:

1. Turn in your complete Sorts.java with your graph.