Gnome Sort Algorithm, Child of Insertion and Bubble sort in 3 minutes!

[@bigocast]

Watch kzbin.info/www/bejne/q6i5aWOAlr-lhtU and see how recursive insertion sort works.

[@Scudmaster11]

I made a my own algorithm that is also a child of bubble and insertion sort... but is so much better than this... AKA the fastest bubble sort - insertion sort super mod... name of this algorithm.. Josie Sort... I have a video of both my custom algorithms if you want to see them... mirror and josie

[@XaxtonRevolution2]

I have seen other videos, and they say that with gnome sort, the way it would actually work in this array is that once element 3 is moved all the way to the beginning, it would compare element 4 with element 3 and swap, if necessary and then compare element 3 to element 2 and then swap if necessary, and so on and so forth until it ended up either comparing an element with the element before it, and coming to the conclusion that the right most element of the two elements being compared, was greater than or equal to the left most element of the two or reached the beginning of the array, whichever happened first. now I am totally confused as to which sword is gnome sort, and which sort is not.

[@calebpillay6675]

Excellent content and highly recommend.

[@bigocast]

Thank you :-)

[@paulavega1251]

Great Video! Thanks :)