Комментарии:
green man pls hurry up bro
Ответитьvallah ayb grün ja was machst du da du esel
ОтветитьGreat video!
Ответитьspeedrun moment
ОтветитьThat graph visualization at the end was ABSOLUTE GENIUS!
Ответитьnice intro
ОтветитьGGWP BUBBLE
Ответитьbeech why u add quick sort click bait
Ответитьsuca
Ответить🥺🥺
ОтветитьI like Cocktail Sort
Ответитьé o vídeo mais lindo do mundooooo
ОтветитьThank you for your effort...
ОтветитьI was subbed to this channel years ago because the bots looked goofy and the videos were interesting but now I have grown and I am here again to learn and pass collage exams.
Ответитьthis was LIFE CHANGING. NEVER have my eyes witnessed such beauty before this glorius day. thank you. for everything. 😘😘
Ответитьwhat of n = infinity
ОтветитьInsertion sort is usually how I sort things, though admittedly a bit less robotic.
ОтветитьCan you demonstrate a competition "rigged" in the underdog's favour? ie. Bubble sort vs merge sort on an almost sorted list, heap sort vs quick sort but you get half the balls now and half the balls when you're done with that, etc
ОтветитьNot here for computer science. Here for the intense competition. It wasn't even a fair match. You'll always be the winner in my heart Bubble Sort :_)
ОтветитьI use that one :)))
ОтветитьCan we have tim and intro sort
ОтветитьI have no idea what any of this is or what it means, i just like watching these sweet lil robot fellas sorting their colourful balls :))))
ОтветитьYou sound like a combination of a caring mother and a patient math teacher. I like it. Especially because of how I'd want a teacher like this. I have ADHD.
ОтветитьI know they're the exact same character model in different colors, but insertion sort looks very smug and I do not like him.
ОтветитьHoly crap I just witnessed "Big-O for kids"
ОтветитьI never forgot merge sort
ОтветитьFar better than anything Wikipedia would offer.
ОтветитьThanks for including the "map" of comparisons. Watched the video several times during the years and every time finding something useful.
ОтветитьPerfect.
Ответитьand so, here we are again, watching educational videos at midnight trying to sleep
Ответитьracism in a nutshell
Ответитьwhat an awesome explanation
ОтветитьThe time complexities are
Best: O(n)
Average: O(n^2)
Worst: O(n^2)
Storage: O(1)
All robots would get painful as heck if the n = 100
ОтветитьThis is awesome! These videos are going to carry me throug my algorithms course!
ОтветитьWhat is really the difference between the two. Both involves comparing the neighbors and swapping
ОтветитьBEST video on algorithms i found yet, LOVE IT
ОтветитьRemarkable!
Ответитьthis poor robot lives inside my cpu?
ОтветитьHow to sort your books:
ОтветитьNow do pigeonhole
ОтветитьInsertion sort at the end was just like "so wtf do i do now"
ОтветитьMaybe if you use numbers on ball instead of colours then it will be more clearer... Comparing colours intensity is sometimes difficult... JazakuMuLLahu Khairan...
ОтветитьRip colourblind viewers
Ответитьno explicite
ОтветитьAwesome ❤
ОтветитьBest AIDS channel ever!
Ответить