<Tr> <Td> A033622 </Td> <Td> (9 (2 k − 2 k 2) + 1 k even, 8 ⋅ 2 k − 6 ⋅ 2 (k + 1) / 2 + 1 k odd (\ displaystyle (\ begin (cases) 9 \ left (2 ^ (k) - 2 ^ (\ frac (k) (2)) \ right) + 1&k (\ text (even)), \ \ 8 \ cdot 2 ^ (k) - 6 \ cdot 2 ^ ((k + 1) / 2) + 1&k (\ text (odd)) \ end (cases))) </Td> <Td> 1, 5, 19, 41, 109,...(\ displaystyle 1, 5, 19, 41,109, \ ldots) </Td> <Td> O (N 4 3) (\ displaystyle O \ left (N ^ (\ frac (4) (3)) \ right)) </Td> <Td> Sedgewick, 1986 </Td> </Tr> <Tr> <Td> </Td> <Td> h k = max (⌊ 5 h k − 1 11 ⌋, 1), h 0 = N (\ displaystyle h_ (k) = \ max \ left \ (\ left \ lfloor (\ frac (5h_ (k - 1)) (11)) \ right \ rfloor, 1 \ right \), h_ (0) = N) </Td> <Td> ⌊ 5 N 11 ⌋, ⌊ 5 11 ⌊ 5 N 11 ⌋ ⌋,..., 1 (\ displaystyle \ left \ lfloor (\ frac (5N) (11)) \ right \ rfloor, \ left \ lfloor (\ frac (5) (11)) \ left \ lfloor (\ frac (5N) (11)) \ right \ rfloor \ right \ rfloor, \ ldots, 1) </Td> <Td> Unknown </Td> <Td> Gonnet & Baeza - Yates, 1991 </Td> </Tr> <Tr> <Td> A108870 </Td> <Td> ⌈ 1 5 (9 ⋅ (9 4) k − 1 − 4) ⌉ (\ displaystyle \ left \ lceil (\ frac (1) (5)) \ left (9 \ cdot \ left ((\ frac (9) (4)) \ right) ^ (k - 1) - 4 \ right) \ right \ rceil) </Td> <Td> 1, 4, 9, 20, 46, 103,...(\ displaystyle 1, 4, 9, 20, 46,103, \ ldots) </Td> <Td> Unknown </Td> <Td> Tokuda, 1992 </Td> </Tr> <Tr> <Td> A102549 </Td> <Td> Unknown (experimentally derived) </Td> <Td> 1, 4, 10, 23, 57, 132, 301, 701 (\ displaystyle 1, 4, 10, 23, 57,132,301,701) </Td> <Td> Unknown </Td> <Td> Ciura, 2001 </Td> </Tr>

Why shell sort is a sort by exchange method