Statements (32)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:averageCaseTimeComplexity |
O(n log n)
|
| gptkbp:bestCaseTimeComplexity |
O(n log n)
|
| gptkbp:designedBy |
gptkb:Tony_Hoare
|
| gptkbp:firstPublished |
gptkb:The_Computer_Journal
1961 |
| gptkbp:hasVariant |
gptkb:Randomized_Quicksort
Dual-pivot Quicksort Three-way Quicksort |
| https://www.w3.org/2000/01/rdf-schema#label |
The Quicksort Algorithm
|
| gptkbp:inPlace |
true
|
| gptkbp:introducedIn |
1960
|
| gptkbp:namedAfter |
quick (fast) sort
|
| gptkbp:parallelizable |
yes
|
| gptkbp:partitioning |
key step
|
| gptkbp:pivotSelection |
key step
|
| gptkbp:recursive |
true
|
| gptkbp:relatedTo |
gptkb:Heapsort
gptkb:Mergesort Introsort |
| gptkbp:spaceComplexity |
O(log n)
|
| gptkbp:stable |
false
|
| gptkbp:supportsAlgorithm |
divide and conquer
|
| gptkbp:usedFor |
sorting arrays
sorting lists |
| gptkbp:usedIn |
gptkb:C++_STL
gptkb:Java_Arrays.sort gptkb:Python_(historically) standard libraries |
| gptkbp:worstCaseTimeComplexity |
O(n^2)
|
| gptkbp:bfsParent |
gptkb:Top_Ten_Algorithms_of_the_20th_Century_(SIAM)
|
| gptkbp:bfsLayer |
8
|