Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:averageCaseTimeComplexity |
depends on gap sequence
|
| gptkbp:bestCaseTimeComplexity |
O(n log n)
|
| gptkbp:category |
divide and conquer algorithms
|
| gptkbp:firstPublished |
gptkb:Communications_of_the_ACM
|
| gptkbp:hasVariant |
gptkb:Ciura's_increment
gptkb:Hibbard's_increment gptkb:Pratt's_increment gptkb:Sedgewick's_increment |
| gptkbp:heldBy |
in-place algorithm
comparison sort |
| https://www.w3.org/2000/01/rdf-schema#label |
Shell sort
|
| gptkbp:improves |
insertion sort
|
| gptkbp:input |
array
|
| gptkbp:introducedIn |
1959
|
| gptkbp:namedAfter |
gptkb:Donald_Shell
|
| gptkbp:output |
sorted array
|
| gptkbp:stable |
no
|
| gptkbp:usedIn |
computer science education
|
| gptkbp:uses |
gap sequence
|
| gptkbp:worstCaseTimeComplexity |
O(n^2)
|
| gptkbp:bfsParent |
gptkb:Donald_L._Shell
|
| gptkbp:bfsLayer |
6
|