Content deleted Content added
Reverted good faith edits by 79.161.0.121 (talk): Log squared is correct here |
Undid revision 1291446250 by Ajmullen (talk) - unsourced |
||
Line 37:
# [[Recursion (computer science)|Recursively]] apply quicksort to the sub-range up to the point of division and to the sub-range after it, possibly excluding from both ranges the element equal to the pivot at the point of division. (If the partition produces a possibly larger sub-range near the boundary where all elements are known to be equal to the pivot, these can be excluded as well.)
The choice of partition routine (including the pivot selection) and other details not entirely specified above can affect the algorithm's performance, possibly to a great extent for specific input arrays. In discussing the efficiency of quicksort, it is therefore necessary to specify these choices first. Here we mention two specific partition methods
=== Lomuto partition scheme ===
| |||