Different Gaps for Comb Sort

In comb sort, the gap is gradually reduced by dividing it by a constant "shrink factor". This video features shrink factors from 1.1 and 1.5, incrementing by 0.05. Empirically, 1.3 is the optimal shrink for comb sort.

**Each "shuffle" is a copy of the array that was only randomly generated once before sorting in order to better compare shrink factors.

[sugarfrosted]

Sure do love when combsort is basically bubble sort.

[smestre]

Oh wow! Can you do the same for shellsort? Maybe include some of the other known gap sequences like the ones described on the shellsort wikipedia page?

Edit: oh i just realized you already did that

[alexanderskladovski]

Why 1.3 is optimal? Our teacher told us optimal value is around 1.247 and showed us some formula for this value.

[d]

Can let "shrink factor" is 2?

[diamboy]

Now I'm curious what if the shrink factor is 2

[jervinsevilla]

What is the difference between Comb sort and Shell sort?

[TornadoHyenyaku]

Bubble Sort & The Cooler Bubble Sort