Heapsort
E459516
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.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Floyd’s algorithm for heap construction | 1 |
| Heapsort canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T4596127 — 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: Heapsort Context triple: [Quicksort, comparedWith, Heapsort]
-
A.
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.
-
B.
Heap
Heap is the surname of Imogen Heap, an English singer-songwriter, producer, and audio engineer known for her innovative electronic music and vocal processing.
-
C.
Fibonacci heap
A Fibonacci heap is an advanced data structure for implementing priority queues that supports very fast amortized running times for operations like insert and decrease-key, making it useful in algorithms such as Dijkstra’s shortest path.
-
D.
heapq
heapq is a Python standard library module that provides an implementation of the heap queue algorithm, offering efficient priority queue and heap-based operations on lists.
-
E.
B-tree
A B-tree is a self-balancing tree data structure that maintains sorted data and allows efficient insertion, deletion, and search operations, commonly used to implement database indexes.
- 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: Heapsort Target entity description: 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.
-
A.
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.
-
B.
Heap
Heap is the surname of Imogen Heap, an English singer-songwriter, producer, and audio engineer known for her innovative electronic music and vocal processing.
-
C.
Fibonacci heap
A Fibonacci heap is an advanced data structure for implementing priority queues that supports very fast amortized running times for operations like insert and decrease-key, making it useful in algorithms such as Dijkstra’s shortest path.
-
D.
heapq
heapq is a Python standard library module that provides an implementation of the heap queue algorithm, offering efficient priority queue and heap-based operations on lists.
-
E.
B-tree
A B-tree is a self-balancing tree data structure that maintains sorted data and allows efficient insertion, deletion, and search operations, commonly used to implement database indexes.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
comparison-based algorithm
ⓘ
in-place algorithm ⓘ sorting algorithm ⓘ |
| averageCasePerformanceComparedToQuicksort | often slower in practice ⓘ |
| basedOn |
binary tree
ⓘ
heap data structure ⓘ |
| cacheFriendliness | moderate ⓘ |
| canBeImplementedIteratively | true ⓘ |
| canBeImplementedRecursively | true ⓘ |
| category |
comparison sort
ⓘ
selection-based sort ⓘ |
| extractionPerElementTime | O(log n) ⓘ |
| hasPhase |
heap construction
ⓘ
repeated extraction ⓘ |
| heapConstructionTime | O(n) ⓘ |
| introducedBy | J. W. J. Williams NERFINISHED ⓘ |
| isComparisonSort | true ⓘ |
| isInPlace | true ⓘ |
| isStable | false ⓘ |
| numberOfComparisonsWorstCase | O(n log n) ⓘ |
| numberOfSwapsWorstCase | O(n log n) ⓘ |
| outputOrderForMaxHeap | ascending ⓘ |
| outputOrderForMinHeap | descending ⓘ |
| primaryOperation |
heapify
ⓘ
sift-down ⓘ |
| relatedAlgorithm |
Mergesort
NERFINISHED
ⓘ
Quicksort NERFINISHED ⓘ Selection sort ⓘ |
| relatedDataStructure | binary heap ⓘ |
| requiresRandomAccess | true ⓘ |
| sortingOrderSupport |
ascending
ⓘ
descending ⓘ |
| spaceComplexityAuxiliary | O(1) ⓘ |
| suitableForLinkedLists | false ⓘ |
| supportsOnlineSorting | false ⓘ |
| supportsRandomAccessArray | true ⓘ |
| timeComplexityWorstCase | O(n log n) ⓘ |
| typicalImplementationLanguageFeature | arrays ⓘ |
| usedIn | systems where worst-case guarantees are important ⓘ |
| usesDataStructure | binary heap ⓘ |
| usesHeapProperty |
max-heap
ⓘ
min-heap ⓘ |
| worksOn |
array of comparable elements
ⓘ
array of keys ⓘ |
| worstCasePerformanceComparedToQuicksort | better or equal ⓘ |
| yearIntroduced | 1964 ⓘ |
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: Heapsort Description of subject: 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.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Robert W. Floyd
this entity surface form:
Floyd’s algorithm for heap construction