Insertion sort with a shrinking gap. Each color outlines a stride-g subsequence; the final g=1 pass cleans up a near-sorted array.
Shell Sort is in-place, non-recursive, unstable. Speed depends entirely on the chosen gap sequence. Ciura is fastest in practice; Pratt is best provable; Shell n/2 is worst.