Shell Sort
1/0
1.0x
Shell Sort
O(n^(3/2))
Space: O(1)
Pseudocode
1
procedure shellSort(A)
2
n ← length(A)
3
gap ← floor(n / 2)
4
while gap > 0 do
5
for i ← gap to n-1 do
6
temp ← A[i]
7
j ← i
8
while j ≥ gap and A[j - gap] > temp do
9
A[j] ← A[j - gap]
10
j ← j - gap
11
A[j] ← temp
12
gap ← floor(gap / 2)
Random Input