Content deleted Content added
I added the fact that quicksort is a comparison-based sort. This notion was added to the page on comparison sorts. The condition is crucial to underpin time analysis. It ensures that the number of comparisons can be used to derive an upper bound for the number of other operations, such as swaps or assignments. |
Corrected the initial Hoare's partition pivot value. |
||
Line 95:
'''algorithm''' partition(A, lo, hi) '''is'''
''// Pivot value''
pivot := A[
''// Left index''
| |||