User Tools

Site Tools


Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
quick_sort [2013/06/15 16:40]
will
quick_sort [2015/02/02 08:28] (current)
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]
quick_sort.txt ยท Last modified: 2015/02/02 08:28 (external edit)