Shell Sort Algorithm Example

[@channelname9468]

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

[@iamundeadtaters2578]

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

[@reyou7]

best shell short explanation ever!

[@ob8346]

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

[@joshiated8597]

Jesus saves.

[@liquidofficialgm]

This is most easy explanation about shell short

[@TheLegend-yb4ok]

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

[@shubhamdubey7718]

I was about to comment on the same thing.

[@prashantjadaun6952]

best ever explanation of any sort love it.....................

[@student4373]

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

[@akseli7029]

yeah this confused me

[@muhammadamjad8649]

briefly and well explained

[@jennyjenjira4572]

okay now I understand

[@minhkhangnguyen4712]

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 ?

[@aicy5170]

yea

[@catbreadcrab9530]

we can all agree this was suppose to happen right cool

[@AMAN-hp7oq]

I think its because of the number of values that are found before 61 (after the switch), the algorithm is still comparing after 6 index's (k = 6), so there isn't 6 index's before 61 so it goes forward not like k = 3 or k = 1

[@Countermeasure941]

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

[@kiche_allan]

Best explanation

[@II_Emilia_II]

well said

[@devn0n]

Thanks soo soo much for this

[@ChitrankDixit]

very nicely explained thumbs up for this :)

[@Rajat-Sharma1]

THANK YOU SO MUCH.

[@abhishekkatiyar7666]

Great Work

[@facundomoran8595]

Thanks!

[@meenakshil1126]

The numbers are not visible it can be little bigger

[@vithushanjegatheeswaran5317]

thanks bro

[@harsh9558]

Thx a lot!!!

[@lovestatussongssatyageetje7928]

Excellent trick

[@EternityUnknown]

Time Complexity: O(3 Minutes)

[@dilln2158]

amazing

[@violinsheetmusicblog]

perfect! thanks!

[@riteshpatidar9184]

Awesome

[@PrinceRachitSinha]

thank you

[@reyxarnoco7279]

thanks man

[@ShaunSpamLol]

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

[@EliasFofanov-aka-EngineerSpock]

The inner loop works as Insertion Sort, not Bubble Sort. Bubble Sort starts the inner loop from the beginning of the array. In this case, it does not. It is quite easy to confuse these two sort algorithms since they are quite similar.

[@uflgeer]

@@EliasFofanov-aka-EngineerSpock спасибо за Ваш курс🙏!

[@ragavakrishnanns6882]

ebic

[@rasikadhande705]

Nice explaination

[@Abhi-kw7tp]

Please upload more videos

[@YulesYes]

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

[@dmumladze]

Would you please care to explain why do you hate it?

[@sureshsingh9880]

🎉🎉🎉🎉❤❤❤

[@ei.o2268]

شكرا

[@nopecharon]

Damn

[@Matyanson]

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

[@SuperfieldCrUn]

Comb sort simply keeps iterating with smaller and smaller gaps. Shell sort, when it gets to an inversion, will start working backwards (so that the low value of the inversion is on the right side of the gap) so long as there's room, then resume the normal iterations once it no longer detects an inversion while going backwards.

[@devn0n]

@@SuperfieldCrUn Thanks a lot man, I was confused as to why @1:10 the indexes of comparison began to go backward instead of forward, so basically, without this "back-tracking", it's just a comb-sort

[@joelsuaznabar5204]

GRACIAS LA EXPLICACION MAS DIRECTA MEAYUDO MUCHO

[@MrGyaancho]

ek no.

[@nemomemo9112]

Nice one

[@bao8212]

It looks like insertion sort

[@muhammad1chsan]

what is k mean?

[@armandmugabo1170]

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

[@EliasFofanov-aka-EngineerSpock]

The inner loop works as Insertion Sort, not Bubble Sort. Bubble Sort starts the inner loop from the beginning of the array. In this case, it does not. It is quite easy to confuse these two sort algorithms since they are quite similar.

[@joshiated8597]

Jesus saves.

[@imsumitsharma]

who and from what?