Added: 2 years ago
From: udiprod
Views: 239,469
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:
see all

All Comments (155)

Sign In or Sign Up now to post a comment!
  • This is such a good video, missed a lecture and this helped me out man!! kudos to you :)

  • I am very happy to see the vidoe after you give this It demonstrates two comparison sorting algorithms: Bubble sort and Quick sort.

  • I Really Like The Video From Your Visualization of Quick sort

  • Your Video Is Very Useful Sharing It demonstrates two comparison sorting algorithms: Bubble sort and Quick sort.

  • after i watched this video, my insight is very open because the video is very good to give information It demonstrates two comparison sorting algorithms: Bubble sort and Quick sort.

  • @the0th not funny, color blinds can still differenciate gray shades

  • Ya know instead of quicksort robot holding the pivot ball in one hand maybe it can place it on top of it's head so both hands are free. I've alway visuallized it as Left-hand && Right-hand, but then again the pivot ball wasn't supose to be picked up like that in the first place.

  • so cute! lol helps alot!

  • this would be useful if i wasn't colour blind.

  • this looks like selection sort

  • Really sweet video! really like it!

  • this is an awesome video that helps me understand quick sort in a quick way! Great job!!!!!!!!!!! :)

  • great video dude... didnt quite understand quicksort though! :(

  • Great job

  • qUICK SORT RULEZ!

  • Poor Bubble sort. Feel bad for him :(

  • Thank you for this great animation, helped me a lot to understand it!

  • Very good.

  • I really love this

  • fantastic animation! Thanks so much!

  • awesome animation, thanks for the upload!

  • aawwww. cutest visualization ever =)

  • love this one, realy help me to understand the difference between bubble sort and quick sort.

  • FANTASTIC!!!! I wish the lessons in my university were like that....

  • I feel sorry for bubblesort0r!!!

  • awesome video!

  • That's brillant! But you should put on this video some music to make it funnier..:)

  • best animation of sorts ever

  • Comment removed

  • watched the whole video with smile on my face

  • writing a class test right now so thx :)

  • this is cool

  • Ok, this video with all these animation is really great to get in mind what happens with bubble and quick sort.. Thumps up for making this ;)

  • Well done!

  • This was awesome. Best sorting algorithm demonstration ever.

  • Thanks from Poland:)

  • why quick sort is winner?

    bubblie sort scored more points!! ;PPP

  • That was fucking awesome, nice video.

  • It would be easier to understand if the differences were of size (big and small) then color.

  • great visual explanation, helped a lot, thanks! =]

  • i love it!

  • cute overload XP

    the quick sort one was slightly confusing when shown like this though, for 2 reasons. #1 The robot needs to walk around a lot more, making it slower. Is this true in the actual algorithm? and #2 The placing of the first "lighter colour" ball on the rack, then suddenly moving on to search the other end of the list. Is that really how it's done?

  • @coffeeteamix Re #1: Indeed Quick sort moves around a lot. When you need to sort a large file on disk, every large move causes loading a different chunk of the file to memory. In this case other algorithms are better (not Bubble sort, though). Re #2: The real Quick sort simply makes a note of the location of 'the first lighter ball' and then moves to search the other end. However when the time come to swap elements - usually this requires putting one of them in a temporary location

  • @udiprod

    it all depends on how you define better, if we are talking time complexity the quicksort is a lot better then most compairable algorithms ie selection and insertion.

  • @coffeeteamix Yes it is really how it is done. Moving it up on the top shelf is symbolic of the extra memory place quick sort needs to work. This extra step can contribute to the time it takes to complete a quicksort but the speed of the method far outweighs the little extra time it may take for the additional step. Quick sort is y= x^2-c with the constant being whatever little extra step you need to do. Compared to Linear which is just y=x.

  • Very good video, but it would have been better if there were more differences between the brightness of the balls as they are not very obvious, especially in brighter balls.

  • this is AWESOME. do more please!!! totally awesome.

  • Poor green robot, it's not your fault.

  • cool way of learning boring stuff

  • It only took me three seconds. I AM MAN!

  • Can u give the download link

  • CAN U GIVE ME THE DOWNLOAD LINK

  • I understood the esence of quick sort with this video. Thanks.

  • why can't the robot get the glance of every ball and memorize their brightness then sort them at once?

  • @pash080 This would just transfer the problem to the robot's memory. Computers must have an algorithm for sorting, even in their memory. You, being human, can 'sort them all at once' using your intuition. Imagine that you need to sort 1,000,000 balls. Since this is too much for human intuition, you would have to resort to an algorithm, just like a computer.

  • @udiprod

    "You, being human, can 'sort them all at once' using your intuition."

    I don't know about that, don't you think were really using an algorithm ourselves, though me may not know we are doing this. The only difference is computers dont "know" they are sorting something. and we do.

  • @heatmourning33 I agree that when someone solves a problem intuitively, there is some algorithm underlying this intuition. What I meant to say was that sometimes it's so simple to solve a problem intuitively, e.g., sorting small lists, that one may mistakingly believe there's no need for an algorithm at all. Then when you want teach a computer how to do it, you suddenly realize you don't even know how you do it :)

  • @udiprod Also, imagine having to sort one million balls by color, and size (each color having x-amount of sizes). This would be impossible for any human, without a system/algoritm to follow. Even simple things like, "First group all balls by color" is an algoritm. Sorting isn't just placing 10 balls in the right order. It's also about scaling it up in insane numbers.

  • very nice.. these types of animations to bring forth knowledge will accelerate the knowledge revolution.. people like you bring quick understanding by applying the kiss method (keep it simple stupid) to demonstration..

  • I can see the efficiency. It's the hardware interface that I'm trying to visualize because it seems to me that Quick Sort would greatly depend upon non-resident memory to enhance it's ability. Just throwing something out there for consideration.

  • Great illustration!

  • It was very very cool!

    Very very very! )

  • excelent video

    tyvm

  • Great job, I love the animation. Seeing things (such as computer theory) work makes things much easer (for me) to understand.  :D

  • Very nice -- I like the comparison too.

  • Excellent video and animation, thanks. Gracias.

  • Thanks, excellent video and explanation. Gracias.

  • LbigOL

  • Great video, although I agree with some of the critics here, like using brightness instead of numbers, I understand the motivation and in the end it all came out very clearly, so great job!

  • I hate quicksort.

  • Very good visualisation. In my opinion, understanding a sorting algorithm helps with writing the code, because you actually know what your writing.

  • thanks - the funny visuals will help me remember this!

  • cool animation :) makes me think of whole sorting championships :D

  • it was exceelent but bolls should be numbered instead of brightness,,,make easy to understand>>>9.5/10

  • I think both colors and letters on the balls would help make it clearer to read.

    It is true that the mind can process color much faster than symbols though.

    But the colors are too similar. Probably got washed out when you loaded it onto youtube? Maybe adding a cool/warm color scheme to the ball colors would be helpful in making the gradient even more easily distinguishable?

    That said, this is the best explanation of quick sort I've found on youtube.

  • super cute!

  • This video was amazing! Very useful and it made me understand a lot better.Thanks!

  • good concept and animation. I wasn't so much of a fan of the sound though

  • i feel i just learned something

  • awsome, love the animation

  • Animation is great but... I found other (much simpler videos) more helpful.

    Still I consider this one OK.

    Just one thing: I don't get is why you've chosen different tints of red rather that putting either numbers or letters on the balls to be sorted? (That would be more transparent to grasp)

  • Two reasons:

    a) To demonstrate that comparison based sorting algorithms can work on any comparable objects

    b) In my opinion it makes it clearer to see at a glance if the balls are sorted or not.

    Anyway, thanks for the comment. I'm sure other videos stress other aspects of quick sort.

  • Ok, but I would at least advise to choose greater colour difference between the balls or/and less balls cause some of the colour differences are hardly distinguishable to my eye & still I'm not a colour blind person :) That can also be intensified by the video compression

    Cheers,

  • @greeppl yes, actually its makes sorting appear a much more comlicated operation that it is!

  • i kinda wanted to see how long it took the other one, ohh well, still a great animation

  • Great video!

  • very funny AND exciting!

  • I still don't have a clue..

  • the robots were so cute and funny that I couldn't help laughing. Great job!!

  • The robots are awesome XD

  • really good !

    Amazing!!!

  • These robots are so lovely! I want to hug them!

  • Awesome!!!

  • never seen such a great sorting-algortihms animation... was really funny to watch this one!

  • very nice visualization

  • really good

  • Comment removed

  • Comment removed

  • really nice!

  • THIS IS GREAT !

  • Amazing!!!

  • Awesome!

  • awesome :D i wondered how quicksort works, cos ive only been able to return the highest number. Now i realize u need to perform multiple runthroughs :D

  • THE BEST ANIMATION!!!

  • Thx to this vid, i may be able to ace my midterm now...

  • thats some intense contest haha.... GO QUICKSORT!!!

  • very nice.. really helpful

  • cool, i love this video!

    i think everyone will understand the idea after watch it.

  • It was AMAZING. Please, if possible, make more of these videos.

  • Comment removed

  • Great video, thanks

  • awesome!

  • It's stuff like this that makes the Internet worth the trouble.

    Very good video.

  • Yeah it sure rocks. Not that the method itself would be really hard to understand, there are far more complex algorithms out there - but I will never ever forget Quick and Bubblesort now. That little robot is now forever sorting inside my brain... ;)

  • AYA HIRANO

  • thanks a million

  • RESPECT MAN

    GREAT VID

  • Good looking out for putting this together, because you simplified what my teacher said which was too confusing.

  • GREAT VIDEO!!!!!

  • This is a fantastic video. It really helps people who learn visually, such as myself. Thank you very much.

  • great video, very funny!

  • this is so beyond educational, it leaves you with a funny visual representation of the method.

    thumbs up

  • Awesome! A really interesting and useful demonstration.

  • For this kind of sort, a Radix would outperform both the quicksort and the bubble sort. It's a 0(kN).

  • This is pair-wise comparison based sorting; Radix sort isn't. The video description's last paragraph says that a broader range of algorithms could have been used, faster than quick sort, had it not been restricted to one type of sorting algorithm.

  • Nice demonstration. I think this would be very useful demonstration, for introductory courses in computer science / programming.

  • Really cool animation! Was really fun to watch. Wouldn't watch it if I wasn't interested in the technial details, but the video wasn't made to show off these, so all in all a 5/5

  • So, did you do the animation algorithmically or by hand?

  • Both. The robots are mostly automatic.

  • @udiprod What animation software did you use for this?

  • @sleelin Autodesk Maya

  • argh! attack of the comic sans!!!!

  • A really good video I'll show the kids, thank you

    BKF

  • I think QuickSort is a pretty cool guy, eh sorts ballz and doesnt afraid of anything!

  • genius!!

  • I love when the robot looks at the balls hehe

  • Poor Bubble sort =/

    He's always being picked on too.

  • I am just wondering does it matter what pivot do we pick? But I am assuming that is does not matter if we take pivot from the middle or beginning or whenever

  • It doesn't matter where you take the pivot from but it does matter where this pivot belongs in the end.

    Ideally you'd want

    to pick a pivot that will split the list evenly.

    I.e., the median. If you have bad luck and you pick the darkest or brightest ball as the pivot, you'll get to do a lot of extra work

  • A common method of picking a pivot is the median of 3. You pick the first, last, and middle items and use the middle value as the pivot. These will always be different items because once you get down to ~10 items, you use something like insertion sort to finish it off.

  • That's pretty bad, it leaves you open to obvious attacks. Random pivot is best.

  • You mean like if the user is trying to be a wise guy and giving you a bad case? If you're afraid of that, you can check to see if quicksort is performing well enough while sorting. If it is not, turn it over to heapsort which cannot be sabotaged to O(n^2) like quicksort can be (see introspective sort).

    The median of 3 has worked very well in practice. With just 2-3 comparisons you drastically improve your chances of getting a value close to the true median.

  • really nice video and representation of the quiksort method

    to be completely correct, you culd some some almost sorted or reverse sorted array of balls :)

  • Very very good work.!

  • wow that's really cool! wich software did u used?

  • Thanks. I used Autodesk Maya

  • made my day :-)

  • really nice one

  • There should be a heapsort vs. quicksort sorting battle.

  • Brillant !

  • Great job! You make these two algorithms extremely easy to understand! Respect!

  • Very nice!

  • that's just wonderful, my friend!

  • excellent visualization

Loading...
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more