Quick Sort


Quick Sort Problems

Problem : Consider the case where every pivot quick sort picks divides the list into one empty list and one list containing elements all greater than the pivot. This degenerate case of quick sort is equivalent to which other sorting algorithm?


Problem : Explain why a sophistocated pivot selection method can be helpful to the efficiency of quick sort.


Problem : Consider the implementation of quick sort given in the summary. Why is that implementation inefficient for the list: (9, 8, 7, 6, 5, 4, 3, 2, 1)?


Problem : Why don't we just search through the data set each time we need to find a pivot and select one that will divide the data set roughly in half?


Problem : In terms of big-O notation, is quick sort's best case any better than merge sort?


Take a Study Break

Green YOUR SCHOOL!

Click here to get involved with dosomething.org!

John Krasinski's BIG MIRACLE

Click to watch the trailer and read exclusive star interviews!

Do you like Anna?

Read Dear Albert... from ANNA's perspective!

BATTLESHIP, the movie

Here's why we're super jazzed about it.


The Book

Cover image

Read What You Love, Anywhere You Like

Get Our FREE NOOK Reading Apps