Statements (30)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:averageCaseTimeComplexity |
O(n log n)
|
| gptkbp:bestCaseTimeComplexity |
O(n log n)
|
| gptkbp:category |
computer science
sorting algorithms |
| gptkbp:firstPublished |
1961
|
| gptkbp:inPlace |
true
|
| gptkbp:introducedIn |
1959
|
| gptkbp:inventedBy |
gptkb:Tony_Hoare
|
| gptkbp:partitioningMethod |
key step
|
| gptkbp:pivotSelection |
key step
|
| gptkbp:spaceComplexity |
O(log n)
|
| gptkbp:stable |
false
|
| gptkbp:supportsAlgorithm |
gptkb:Bubble_sort
gptkb:Heapsort gptkb:Insertion_sort gptkb:Mergesort divide and conquer |
| gptkbp:usedFor |
sorting arrays
sorting lists |
| gptkbp:usedIn |
gptkb:C++_STL_sort
gptkb:Java_Arrays.sort gptkb:Python_(historically) standard libraries |
| gptkbp:worstCaseTimeComplexity |
O(n^2)
|
| gptkbp:bfsParent |
gptkb:Tony_Hoare
gptkb:Sir_Tony_Hoare |
| gptkbp:bfsLayer |
5
|
| https://www.w3.org/2000/01/rdf-schema#label |
Quicksort
|