Hoare partition scheme
E462227
The Hoare partition scheme is a classic in-place array partitioning method used in quicksort that employs two indices moving toward each other to rearrange elements around a pivot.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Hoare partition scheme canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T4596115 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Hoare partition scheme Context triple: [Quicksort, partitionScheme, Hoare partition scheme]
-
A.
Lomuto partition scheme
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.
-
B.
Quicksort
Quicksort is a highly efficient, comparison-based sorting algorithm that uses a divide-and-conquer strategy and is widely employed in computer science and software systems.
-
C.
Heapsort
Heapsort is a comparison-based sorting algorithm that uses a binary heap data structure to sort elements in-place with O(n log n) time complexity and O(1) auxiliary space.
-
D.
Merge sort
Merge sort is a comparison-based, divide-and-conquer sorting algorithm that recursively splits a list into halves, sorts them, and then merges the sorted halves into a fully ordered sequence.
-
E.
Divide and Conquer
"Divide and Conquer" is a World War II-era American propaganda documentary in the "Why We Fight" series that chronicles Nazi Germany’s invasion and subjugation of Western Europe.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Hoare partition scheme Target entity description: The Hoare partition scheme is a classic in-place array partitioning method used in quicksort that employs two indices moving toward each other to rearrange elements around a pivot.
-
A.
Lomuto partition scheme
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.
-
B.
Quicksort
Quicksort is a highly efficient, comparison-based sorting algorithm that uses a divide-and-conquer strategy and is widely employed in computer science and software systems.
-
C.
Heapsort
Heapsort is a comparison-based sorting algorithm that uses a binary heap data structure to sort elements in-place with O(n log n) time complexity and O(1) auxiliary space.
-
D.
Merge sort
Merge sort is a comparison-based, divide-and-conquer sorting algorithm that recursively splits a list into halves, sorts them, and then merges the sorted halves into a fully ordered sequence.
-
E.
Divide and Conquer
"Divide and Conquer" is a World War II-era American propaganda documentary in the "Why We Fight" series that chronicles Nazi Germany’s invasion and subjugation of Western Europe.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
algorithm
ⓘ
array partitioning algorithm ⓘ partition scheme ⓘ |
| advantageOverLomuto |
better performance on many inputs
ⓘ
fewer swaps on average ⓘ |
| appearsIn |
algorithms textbooks
ⓘ
data structures and algorithms courses ⓘ |
| category | comparison-based partitioning ⓘ |
| commonPivotChoice |
first element of the array
ⓘ
middle element of the array ⓘ |
| comparedWith | Lomuto partition scheme ⓘ |
| describedIn | Quicksort paper by C. A. R. Hoare ⓘ |
| doesNotGuarantee | pivot ends at its final sorted position ⓘ |
| ensures | all elements in left part are ≤ some element in right part ⓘ |
| field | computer science ⓘ |
| hasInvariant |
elements left of left index are ≤ pivot candidate region
ⓘ
elements right of right index are ≥ pivot candidate region ⓘ |
| hasProperty |
loop with crossing indices termination condition
ⓘ
two-pointer technique ⓘ |
| implementationDetail |
decrements right index until element ≤ pivot
ⓘ
increments left index until element ≥ pivot ⓘ swaps elements at the two indices when left ≤ right ⓘ |
| influenced | later partitioning algorithms ⓘ |
| introducedBy |
C. A. R. Hoare
ⓘ
linked to:
Tony Hoare
|
| introducedIn | 1961 ⓘ |
| isInPlace | true ⓘ |
| isStable | false ⓘ |
| output | index separating two partitions ⓘ |
| partitionStrategy | two indices moving toward each other ⓘ |
| pivotUsage | rearranges elements around a pivot ⓘ |
| relatedConcept |
divide-and-conquer algorithms
ⓘ
quicksort partition step ⓘ two-way partitioning ⓘ |
| requires | random-access array ⓘ |
| spaceComplexity | O(1) ⓘ |
| subfield |
algorithm design
ⓘ
sorting algorithms ⓘ |
| terminationCondition | indices cross ⓘ |
| timeComplexityAverageCase | O(n) ⓘ |
| typicalImplementationLanguage |
C
ⓘ
C++ ⓘ Java ⓘ |
| usedFor |
divide-and-conquer sorting
ⓘ
in-place array partitioning ⓘ |
| usedIn |
in-place quicksort implementations
ⓘ
quicksort ⓘ |
| worksWith | total order on elements ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Hoare partition scheme Description of subject: The Hoare partition scheme is a classic in-place array partitioning method used in quicksort that employs two indices moving toward each other to rearrange elements around a pivot.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.