But to assign the kids values by height, they would have to be initially sorted by height, before numbers are assigned... Which algorithm is the best choice? :D
Bubble sort doesn't need to walk the entire array over an over. The last item is always highest or lowest value depending on your sort. So every time you start to walk over the array you can stop 1 item earlier. Then you can look how many items aren't swapped before you reached the end, you can even stop before these items the next walk. When no item is swapped at all everything is sorted. Now it would only take 5 years because now the list went from 225 iterations back to 75 this way :D
Oh my god....I had always trouble understanding mergesort...but this is genius....now its Clearasil in my mind.....thanks for making our understanding clear
Good one i liked it. But a small clarification , as per my knowledge, insertion sort creates new list by inserting element in sorted order, it does not do swapping but selection sort does swapping. Here its shown in in opposite manner...
@rsatheesh4utube No, Insertion sort is an inplace sort, it doesn't create a new list. I just keeps given array as two sections, 1) sorted section 2) Unsorted section. As the insertion sort proceeds Section-1 keeps growing and section-2 gradually disappears.
While I do appreciate your effort, the music, and your hat, I would suggest that for this type of this you do a test run to see what the footage you shoot is going to look like. Can't see anyone's numbers! This is mostly made up for with the numbers edited in after though.
Very nice way of showing sorting. But, the bubble sort seems to be made very slow on purpose since you keep scanning all of the numbers even when you know what part is already sorted.
Piotr Kusmierczyk That's a nice algorithm, and i would like to ask if you can do it with the integers(numbers) : 84, 25, 16, 98, 5, 78, 25, 71, 2, 12, 24, 72
My favorite video when it comes to explain algorithm complexity to a friend or family member
Should have given the numbers to the kids by height (shortest kids get smallest numbers) so it would be easier to visualize how sorted the list was.
But to assign the kids values by height, they would have to be initially sorted by height, before numbers are assigned... Which algorithm is the best choice? :D
best visualization of sorting algorithms i have ever seen. Awesome
This was brilliant ! Thanks so much
This is a VERY well done description of all the types of sorting algorithms!!! Well done!!
Thanks for uploading, too. I shared this video to my students who are so confused with this topic. Cheer !
Bubble sort doesn't need to walk the entire array over an over. The last item is always highest or lowest value depending on your sort. So every time you start to walk over the array you can stop 1 item earlier. Then you can look how many items aren't swapped before you reached the end, you can even stop before these items the next walk. When no item is swapped at all everything is sorted. Now it would only take 5 years because now the list went from 225 iterations back to 75 this way :D
Bogo is the slowest of all sorting algorithms
that crown goes to bozo sort, bogo bogo sort or meircal sort (bad spelling)
Oh my god....I had always trouble understanding mergesort...but this is genius....now its Clearasil in my mind.....thanks for making our understanding clear
Good one i liked it. But a small clarification , as per my knowledge, insertion sort creates new list by inserting element in sorted order, it does not do swapping but selection sort does swapping. Here its shown in in opposite manner...
That was genius. Truly genius.
Great effort, great coordination, great video.
Very good video. =D The last part is especially hilarious. xD
Awesome video sir helped me a lot ! Looking forward to watch more videos and learn smartliy like such !
now,that was easy 4 understanding the different sort .especially bubble sort.thank u
@rsatheesh4utube No, Insertion sort is an inplace sort, it doesn't create a new list. I just keeps given array as two sections, 1) sorted section 2) Unsorted section. As the insertion sort proceeds Section-1 keeps growing and section-2 gradually disappears.
Loved it! Thanks for the help!!
I hit Like after I read the description before even watching the video :]
While I do appreciate your effort, the music, and your hat, I would suggest that for this type of this you do a test run to see what the footage you shoot is going to look like. Can't see anyone's numbers! This is mostly made up for with the numbers edited in after though.
Very nice way of showing sorting. But, the bubble sort seems to be made very slow on purpose since you keep scanning all of the numbers even when you know what part is already sorted.
BersekViking ironically, bubble sort actually does this...
Further development suggestion: add TimSort presentation to the video. :D
thanks for uploading, a great visualization on sorting!
Nice, i wanna see quick sort too !!
I like how u slowed down the music for bubble sort
5:11 lol NO DOUBT! THIS VID IS PART OF MY FAV ONES!!! CONGRAT!!
It's helpful.we can understand easily.
this was the best explanation but it probably took more than half an hour
Good video, could anyone tell me the name of the music in the end?
Fantastic video.... made evrythng so easy..... keep it up :)
nice job! Thanks from Argentina
Is interference from cosmic rays a major problem for programmers?
this is great ; thank you!
Wow cool video ! But can someone tell me pls , how can log n stays there in the O - Notation ?
willie ekaputra it is actually log base two of n => log_2(n) which is a function
Tq.
What's the music at the end, btw?
Hey! Can you guys explain TimSort?
Quick sort ?
Cool, thanks for the demo.
That is so great, thank you
It was amazing, thanks.
i really liked it i was so interesting
That's not how you merge sort. Or is it?
Le preguntan "cual es la mejor manera de ordernar 1 millon de numeros enteros" y obama dice "creo que bubblesort seria lo incorrecto"
Great video!
nice! keep the good work!
bonus marks for the ragtime music :D
Now do base 10 LSD radix sort. And for extra credit, do gravity sort.
I realy liked it thanks a lot !
Really good :D I liked it xD
Thanks guys! : )
Hilarious video! GJ!
i was given this as a lesson
This is very good
3:16 they just warped space and time
very very nice video
Thanks, very useful :)
gracias che!
Hey the slowest is selection sort not bubble sort :P
Actually selectionsort is way faster than bubblesort (in average).
Also, there are algorithms even slower than bubblesort, like bogosort
Learning is fun :D amazing to the power infinity !!!!!
thank you soo much
You better apologize for bubble sort! =D
hey bruh.-joe 2016
Thanos so much
You forgot bogosort
My right ear feels lonely...
Poor poor bubble sort, but great video :D
public class PidgeonHoleSort {
public static void main(String[] args) {
int[] unsorted={6,1,13,7,11,9,2,8,15,5,3,4,12,10,14};
int[] sorted=new int[15];
for(int i=0;i
Piotr Kusmierczyk That's a nice algorithm, and i would like to ask if you can do it with the integers(numbers) : 84, 25, 16, 98, 5, 78, 25, 71, 2, 12, 24, 72
hustik
public class PidgeonHoleSort {
public static void main(String[] args) {
byte[] unsorted=new byte[] {84,25,16,98,5,78,25,71,2,12,24,72};
byte maxExpectedIntVal=100;
byte[] sorted=new byte[maxExpectedIntVal];
for(int i=0;i
was that Obama talkin about the bubble sort()?
Nice!
3:16 near data loss
Pleeeeeease make heap sort for us... :D
This is so cool loll
thank u
funny
hehe. Funny and great.
1:27
Nice work. 1337 views, heheh.
ไรอ่ะไม่รุ้
[P]oise ก็ดี ไม่ต้องไปเรียนอยู่บ้านเราไม่ต้องมานั่งดูคลิปที่เราจะได้ไปแล้วครับขอดูหน่อยสิคะจะไปนะครับนะคะขอบคุณมากเลยครับขอดูหน่อยสิคะ
ไม่ต้องไปเรียนอยู่บ้านยังครับขอบอกให้แม่ไปนะแต่ก็ต้องมาบ้านเรามีอะไรครับพี่ครับขอชื่อด้วยครับพี่ครับขอชื่อหน่อยครับผมทำอะไรก็ไม่ต้องมานั่งดูคลิปที่เราจะได้ไปแล้วครับขอ
que dice obama??
bubble sort music is creepy... but worse sort is worse than anything worser than bogo sort or bozo sort
gud one
อะไรอะ
เรวรรธ จันทรรัตน์ ก็มาดิคับ
Korawit Phuengsuk ไปนะบางทีมันนานไปละมั้งนะแต่ก็ต้องมาบ้านพี่มีความสุขดีอยู่แล้วแต่
I like !!!!!
Cosmic rays! Heheh!
"hee hee hee"
1000 likes!!!
top
this is so bad I bet malachite could do better
Oh magic🇹🇭
Great video!