# Differences

This shows you the differences between two versions of the page.

 quick_sort [2013/06/15 16:40]will quick_sort [2015/02/02 08:28] (current) Both sides previous revision Previous revision 2013/06/15 22:24 will 2013/06/15 16:40 will 2012/10/04 21:59 external edit2012/09/30 22:31 will 2012/09/03 11:39 will created Next revision Previous revision 2013/06/15 22:24 will 2013/06/15 16:40 will 2012/10/04 21:59 external edit2012/09/30 22:31 will 2012/09/03 11:39 will created Line 3: Line 3: [algorithm quick sort] [algorithm quick sort] - The simple version of quicksort uses $O(n)$ extra storage space. The in-place version of quicksort uses $O(log n)$ extra space. The in-place version of the algorithm uses ''​partition''​ which partitions a subrange of an array so that elements less than the pivot are before it and elements greater than the pivot are after it. + The simple version of quicksort uses $O(n)$ extra storage space. The in-place version of quicksort uses $O(\log n)$ extra space. The in-place version of the algorithm uses ''​partition''​ which partitions a subrange of an array so that elements less than the pivot are before it and elements greater than the pivot are after it. [algorithm quick sort in-place] [algorithm quick sort in-place]