← All sorting algorithms
Shell Sort
DefaultComparingSwappingPivotSorted
Main Array Workflow
8
3
11
6
1
9
4
7
pseudocode
shellSort(a):for gap = floor(n/2) down to 1 (gap /= 2):for i = gap to n-1:j = iwhile j >= gap and a[j-gap] > a[j]:swap a[j-gap], a[j]j = j - gap // step backward by gap
Frame 1 / 30
Start
unsorted array
4
3–16 integers between 1 and 20.