Lomuto partition scheme
E459514
The Lomuto partition scheme is a simple, commonly taught method for partitioning arrays in the Quicksort algorithm by using a single index to separate elements less than a chosen pivot from those greater or equal.
Statements (33)
| Predicate | Object |
|---|---|
| instanceOf |
algorithmic technique
ⓘ
array partitioning method ⓘ partition scheme ⓘ |
| canLeadTo | more swaps than Hoare partition scheme ⓘ |
| category | sorting algorithm component ⓘ |
| commonIn |
educational materials on sorting algorithms
ⓘ
textbook implementations of Quicksort ⓘ |
| comparedWith | Hoare partition scheme NERFINISHED ⓘ |
| isStable | no ⓘ |
| lessEfficientThan | Hoare partition scheme in practice ⓘ |
| namedAfter | Nico Lomuto NERFINISHED ⓘ |
| numberOfScans | one forward scan of the array segment ⓘ |
| originatedIn | analysis of Quicksort algorithms ⓘ |
| partitionProperty |
all elements left of pivot index are <= pivot (for standard variant)
ⓘ
all elements right of pivot index are > pivot (for standard variant) ⓘ |
| pivotPositionAfterPartition | final index of pivot in partitioned array segment ⓘ |
| pivotSelectionTypical | last index of current subarray ⓘ |
| requires | total order on elements for comparison ⓘ |
| requiresRandomAccess | yes ⓘ |
| separatesElementsBy | comparison with pivot ⓘ |
| separatesInto |
elements greater than or equal to pivot
ⓘ
elements less than pivot ⓘ |
| spaceComplexity | O(1) auxiliary space ⓘ |
| timeComplexity | O(n) for partition step ⓘ |
| typicallyTaughtAs | introductory example of partitioning ⓘ |
| usedFor | divide step of Quicksort ⓘ |
| usedIn | Quicksort NERFINISHED ⓘ |
| usedWith | in-place Quicksort ⓘ |
| usesIndexingStrategy | single index to separate elements ⓘ |
| usesPivot | last element of the array segment ⓘ |
| usesSwaps | to move elements less than pivot to left side ⓘ |
| worksOn |
array-like sequences
ⓘ
arrays ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.