Shell's Sort

Visualization and "audibilization" of Shell's Sort algorithm.
Sorts a random shuffle of the integers [1,100] using Shell's sort with Sedgewick's gap array.

[uprprsn]

So shell sort is basically to compare two numbers from a fixed distance, and put it so that the bigger is on the right of the two numbers' original position, then divide the distance by a half and repeat, until everything's solved.

[vitex]

Shell sort is kind of like the equivalent of running a comb over the list over and over again until it's sorted.

[morgansullivan]

These are all really cool but I wish there was a layman-friendly explanation for how each one works. It's fun trying to figure it out on my own but I am completely lost with this one. :(

[theAmazingJunkman]

It looks like comb sort, but its actually a hyper optimized, divide-and-conquer version of insertion sort

[want-diversecontent]

Shell sort: Insertion sort on gaps. You might think it's best to do 2^n, but you can do better than that.

[groszak]

It's Incerpi-Sedgewick gap sequence, not Sedgewick. Multiple gap sequences may be named Sedgewick

[legendgames]

I learned that you compare 2 elements at a distance and sort them, move on to the next element and repeat until I get to the end of the array, make the comparison distance - 1 = new distance and so forth

[want-diversecontent]

Gnome shell sort.
Like shell sort, but instead of applying insertion sort, you apply gnome sort.