Insertion sort
E459517
Insertion sort is a simple comparison-based sorting algorithm that builds a sorted list one element at a time by inserting each new element into its proper position.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Insertion sort canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T4596128 — 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: Insertion sort Context triple: [Quicksort, comparedWith, Insertion sort]
-
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.
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.
-
C.
Fibonacci search
Fibonacci search is a divide-and-conquer search algorithm for sorted arrays that uses Fibonacci numbers to determine probe positions instead of midpoints.
-
D.
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.
-
E.
Introduction to Algorithms
Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
- 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: Insertion sort Target entity description: Insertion sort is a simple comparison-based sorting algorithm that builds a sorted list one element at a time by inserting each new element into its proper position.
-
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.
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.
-
C.
Fibonacci search
Fibonacci search is a divide-and-conquer search algorithm for sorted arrays that uses Fibonacci numbers to determine probe positions instead of midpoints.
-
D.
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.
-
E.
Introduction to Algorithms
Introduction to Algorithms is a widely used, comprehensive textbook on algorithms and data structures, renowned for its rigorous yet accessible coverage of theoretical and practical topics in computer science.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
comparison-based algorithm
ⓘ
in-place algorithm ⓘ sorting algorithm ⓘ stable sorting algorithm ⓘ |
| advantage |
good performance on nearly sorted inputs
ⓘ
good performance on small inputs ⓘ simple implementation ⓘ |
| basedOn | building a sorted prefix of the array ⓘ |
| bestCaseInput | already sorted array ⓘ |
| category | simple quadratic-time sorting algorithms ⓘ |
| commonlyTaughtIn | introductory algorithms courses ⓘ |
| commonlyUsedFor | teaching sorting concepts ⓘ |
| comparedWith |
bubble sort
ⓘ
merge sort ⓘ quick sort ⓘ selection sort ⓘ |
| dataStructureSorted |
array
ⓘ
list ⓘ |
| disadvantage | quadratic time on large random inputs ⓘ |
| isAdaptive | true ⓘ |
| isInPlace | true ⓘ |
| isStable | true ⓘ |
| maintains | a growing sorted prefix ⓘ |
| numberOfShiftsWorstCase | O(n^2) ⓘ |
| oftenUsedInside | hybrid sorting algorithms ⓘ |
| origin | early computer era sorting methods ⓘ |
| processesElements | left to right ⓘ |
| requires | sequential access ⓘ |
| sortingOrder |
non-decreasing
ⓘ
non-increasing ⓘ |
| spaceComplexityWorstCase | O(1) ⓘ |
| suitableFor |
nearly sorted data
ⓘ
online sorting ⓘ small arrays ⓘ |
| supports | online algorithm behavior ⓘ |
| timeComplexityBestCase | O(n) ⓘ |
| timeComplexityWorstCase | O(n^2) ⓘ |
| typicalImplementationLanguage |
C
ⓘ
C++ ⓘ Java ⓘ Python ⓘ |
| usedAsBaseCaseFor |
merge sort implementations
ⓘ
quick sort implementations ⓘ |
| uses |
comparison operations
ⓘ
element insertion ⓘ |
| worksBy | inserting each element into its correct position in the sorted part ⓘ |
| worstCaseInput | reverse sorted array ⓘ |
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: Insertion sort Description of subject: Insertion sort is a simple comparison-based sorting algorithm that builds a sorted list one element at a time by inserting each new element into its proper position.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.