Best Case and Worst Case Trees for Running Time
The analysis suggested that the worst case would be n^2 and the best case nlogn which would produce a greater disparity between best and worst.