Sorting Algorithms: Shellsort

Показать описание

Developed by Donald Shell in 1959, Shellsort sorts items at intervals and slowly reduces the size of the interval until Bubble Sort quickly sorts the nearly-sorted data.

"Heliograph" written and performed by Chris Zabriskie

Рекомендации по теме

Комментарии

Wrong sort. Shellsort uses more than 2 sorting lines. The sort in the video is Comb sort.

gisibah

Comb/shell sort appears like a great way to make a randomly ordered list ALMOST sorted but not entirely. Like if you wanted to organize a library and called it good enough when every book was less than 5 places from its correct position, you could use comb/shell sort to sort more quickly than another sort that goes to completion.

JHandle

that is a comb sort, not a shell sort!

danieldelizaur

now these points of data make a beautiful line...

jesarux

people in the comments: this is a comb
me: haha it do the thing and then vwoomp triangle hehe

starsiix

comb sort is bubble sort
shell sort is insertion sort

thedoubleap

Is the last one simplified to reduce the comparison window by like 100 instead of one unit?

oliveguy

This seems reasonably fast in getting data "almost" sorted, but agonisingly slow in the final stages. What if you were to run a few passes on the data, then switch to quick sort - using the centre element of each partially sorted group as the pivot?

mandolinic

Its not lsd in place base 10
Therefore it is beneath me.
There can only be 1 sorting algorithm.
It can only be led in place base 10

majestoony

I implemented Shell sort in 8080 assembler back in 1980 on an Apple ][+ with a Z-80 coprocessor with CP/M. In-memory. Ran like a scalded cat! And, yes, this is a Shell sort. Never heard of 'comb sort', but the logic is evidently similar enough to give some of you a wedgy over the terminology.

johngeverett