Explanation for the article: This video is contributed by Arjun Tyagi.
Tag: shell sort c++, [vid_tags]
Xem Thêm Bài Viết Về Mẹo Hay Khác: https://meocongnghe.vn/meo-hay
Nguồn: https://meocongnghe.vn
Explanation for the article: This video is contributed by Arjun Tyagi.
Tag: shell sort c++, [vid_tags]
Xem Thêm Bài Viết Về Mẹo Hay Khác: https://meocongnghe.vn/meo-hay
Nguồn: https://meocongnghe.vn
please remove this video. Its full of errors .
really? arr[j] = arr[j-gap] then arr[j] = temp? lol, maybe you mean arr[j-gap] = temp, right?
by the way im not the real pewdiepie.
GFG WEBSITE : 🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥🔥
GFG YT CHANNEL : 🎆
some of the geeksforgeeks videos are really bad
rule no. 1 – When someone is trying to learn, turn that irritating bg music off!
behold the most useless sorting tutorial on youtube
Understood sir
At 0:58, shouldn't arr[gap=2] not arr[gap=4]?
It just explain like numbers are arranged in ascending order
GeeksforGeeks is not a name it's a brand.
Em ardham kala
I couldn't understand the pattern from the animation. The presentation here makes it so easy to understand though it is not error-free:
https://www.youtube.com/watch?v=M9YCh-ZeC7Y
What is the melody called?
well, straight of the bat a lie, shellsort sorts adjacent elements if the gap size includes size 1, its accually then a insertionsort but still it sorts adjacent if the gap is 1..
Amazing video! Beautifully taught.
Implemented this concept in coding in no time! Big thumbs up.
Galat hai bhai galat hai…Aktu wale fail ho jayenge isse😔
Gap = 2 at 0:57
Worst explanation
Yeh kya bawaseeer hai
The code has some flaw in it. After swapping 3 and 54 in the third iteration, how 3 and 12 is getting compared . Visually it is clear but the algorithm is not functioning as shown in the Animation.
Nice, sure quick and easy to understand. Thanks!
Check better explanation of Shell sort from here: https://www.youtube.com/watch?v=SCBf7aqKQEY
It's the best 2-minute explanation I've ever seen! Just think about it – 2 minutes!
Ideal for quick review. Thanks!
I keep getting an array one position fix from sorted. The numbers and order I used were 7, 3, 14, 2, 9. If anyone could show me the way to shell sort this correctly I would be very happy!
Well these videos are not to build concepts but to revise them .
very helpful and clear concept
Thank you very much for your help in algorithm .
yo im geekin
Would help if the sample size was larger, preferably 16 (as it divides by 2 several times)
this makes absolutely no sense
The music is too annoying
An example with a larger array that requires at least three different gaps would be easier to understand. It's harder to pick up on the pattern when you basically only have two iterations
http://www.sanfoundry.com/c-program-implement-shell-sort/
code here will make you understand better. In this code i = gap.
Not as intuitive of your other videos.
Using 5 elements for Shell sort example is a really bad idea.
I take half of hour to understand this algorithm when watching this video. But now I understood it better than before. Great explantion