Shell Sort Algorithm Example

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

Рекомендации по теме
Комментарии
Автор

bro this makes so much sense now, man didn't even need any sound to explain it more efficiently than everyone else on the platform

channelname
Автор

AFter spending an hour looking for some sort of explaination, this video does it the best, thank you soo much!

iamundeadtaters
Автор

Wow, I'm surprised this algorithm is so effective. Great explanation!

ob
Автор

there is a little mistake which can be confusing, around 0:56-1:00 just after algorithm swaps 111 and 61, it needs to check 24 and 61 before moving on, you left that out of the video, it was confusing for me while watching it and reading the code of shell sort

TheLegend-ybok
Автор

This is most easy explanation about shell short

liquidofficialgm
Автор

great video ! But I'm curious at 0:56 after switching 61 and 111 why didn't we compare 61 again with 24 because I think that it's supposed to compare again after the switch ?

minhkhangnguyen
Автор

best ever explanation of any sort love

prashantjadaun
Автор

Great video, the only missing comparison is at 0:56, comparing 24 to 61. Otherwise, great video.

student
Автор

The numbers are not visible it can be little bigger

meenakshil
Автор

This is good but your inner loop seems to be more like bubble than insertion sort, which I think is standard/faster.

ShaunSpamLol
Автор

 Thank you very much for this video! It was informative for me.

Countermeasure
Автор

very nicely explained thumbs up for this :)

ChitrankDixit
Автор

What, isnt this the same as a comb sort then??

Matyanson
Автор

this was so cute! I hate shell sort but I love this video!

YulesYes
Автор

is that shell short with bubble sorting of the sub array instead of insertion sort ?

armandmugabo
Автор

GRACIAS LA EXPLICACION MAS DIRECTA MEAYUDO MUCHO

joelsuaznabar