Visual Demonstration of the QuickSort Algorithm

[ennessaqua]

thanks a lot man !! my hands are itching to implement this in code

[katzeonline]

thx

[amarchendra]

fabtastic



[Luckysevenization]

Now i know, thanks for your clear explanation, teacher!.

[TheRAVIKELAKAM]

very good

[2436215]

awsome video sir.... thank you so much for making it so easy..... :D

[prathyushapeddi87]

awesome man!!

I understood it very clearly and able to write a code very soon

[infinitehz02]

This is very useful, sir! Thank you for posting this :) This helped me a lot. :D

[bill18ization]

Awesome video. I never actually understood the concept until i saw this video.

[KillerChaca]

GREAT VIDEO! I was having troble understanding the logic, but you´ve made it very simple. Much better then the textbooks I got here.

Thanks a million!

[MrMcFranky]

great explaination, superb content, but the quality(sound/video itself) is a little bit odd. Nonetheless, great video overall!

[saberdam]

very good

[q3nm]

this shows how practical knowledge helps rather than bookish knowledge...

gr8 work sir...thnx a lot

[leverkusener77]

Great Video! Thank you!

[yiannakyp17]

the most helpful explanation on quicksort, Thanks sir

[saurabhliita007]

really nice............d best visualisation i could find....thnx a lot man.....

[xxxTokioHotelxxxx]

 I love you man :D!!!!! finally i understood quicksort

[xumairx]

very well explained!

[KonKaji]

thank you very much sir,

i could not understand it on the textbook but you sure have helped.

I think you should have a version 2, with better light and possibly a more deeper case scenario like having an unsorted number equal to the pivot, anyway thanks man.

[abhinavgaur13]

thank you for a very nice description ..

1 hour of book reading condensed in to 7 mins ..

[mvnvm]

Nice job, Thank you

[hvaroqua]

This clarification and simlification is a great. Thank you sir.

[garethstar]

cheers dude



[AJSwisgirl]

Thank you soooooo much....!!!

[ravikelakam]

Better implementation of idea..... keep it up..



[LiveMr1990]

Excellent... Thank you very much sir....

[reynaldsusain]

Wow! great video!! I Thank you so much :)

[jdoyon007]

Nice! Thank you!

[ZeF2007inc]

This video is perfect.

[aderussell455]

This is a fantastic way of describing the quick sort!!

[mdbluelily]

Thank you. It was great.

[ZeKalanga92]

thanks man :D it really helped me to understand the quicksort

[ZeKalanga92]

thanks man :D

[firari1cars]

thanks a lot. it is much easier than the way my prof. explained it. nice usage of red and blue.

[moveaxebx]

It's not very quick...it took 7min and 32 seconds just to sort 8 numbers....

.

.

.

:D

[eyez666]

Thanks alot !

[siddiqiarsalan]

good job!!! thanxxx ..... it helped me alot

[stevestizzy]

THANK YOU SOOOOO MUCH :) ... before your video ,,, it was ... too complicated (from some memos i had.... ) but know it' soooo clear :) thanks a lot mate :)

[toxicalali]

suberb explanation. Thanks

[kickit246]

This algorithm is hard... argh, I hope there isn't a programming question on this on my final tomorrow :/.

[ceasarmanil]

Thanks A lot...Now I understand..

[HowToDo92]

Very Nicely Done!!

[adobepr0]

Thanks, nicely done.

[theycallmest3r]

AMAZING. i understand your implementation very well. i like this one. in my class, we learned one where you use the median as your pivot, pull it out and push it to the back of the array..then sort the left and ride sides of the median, etc. but i like this better, its easy. with our implementation, instead of having "colissions" of the left and right pointers, we have "Crossing". it's wierd >_<

[kgsrinivas123]

nice.....easy 2 understand the basic concept

[piyushchitkara]

What a great way to explain.. Thank you so much.. :)

[rubencas1000]

YOUR AMazing!!! i couldnt understand my own instructor. Please continue making videos.

[saadazzz]

Greattttt explanation!

Thank youuuuuuuu

[Rhembot]

Thanku...great

[MsTooshae]

i wish ur voice was more clearer.. but then i still understood your demonstration

[MsTooshae]

i wish ur voice was more clearer.. but then i still understood ur demonstration

[emitate]

excelente video! muchas gracias por tomarte el tiempo para realizarlo!

[praveenmandloi51]

great video. everyone easily understand quick sort by the help of this video.

thanxxxxxxxxxxxxxxxxxxxxxx

[01skraggy]

Thanks, mate! Good job!

[leexuanxuan]

thanks for the explanation. It's clear and straight to the point. My quick sort lecture notes are too diffcult to understand.

[ml497]

Even a monkey could understand quicksort with this explanation :P

[bilalkhanalizai]

a very nice demonstration thanks alot for that. . . just a small question about it? the pivot element is always chosen as the left most element of array in this case. . .CAN WE NOT CHOOSE ANY RANDOM PIVOT ELEMENT from the array instead of going for left most???

[stenland]

@bilalkhanalizai There are numerous ways to do it. If you are using an algorithm that can sort any list and you just feed it lists, there is no way for you to know in advance what you will be sorting, and in which state the list is already ordered. In this case its normal to chose an element such as the leftmost, or to sort the first, middle and rightmost elements and then chose the correct middle element as your pivot, thus giving you a median and higher chance of not getting a worst case sort

[stenland]

@bilalkhanalizai Part 2: However in a situation where you can actively see and react to what you are sorting(f.ex a deck of cards or numbers like in this video) it is normal to select a pivot that you know for a fact is as middle as possible, in the case of this video 4(strategicly placed 1st in this video:)). Had 8 been placed first in this video, im sure you can see the weakness of selecting the first one, since you need to do more sublist sortings(worst case)

[armo4526]

Great video! Thanks.

[bearhuntaa]

great explanation. thank you. looked for a good hour for a good explanation of this algorithm

[yrollgayanth]

superb demonstration...5*

[sneglur18]

how do v go about moving the pointers from numbers 7 and 8 i.e once 7 and 8 are sorted, how do we take our pointers to d leftmost part of the array i.e to 2 3 1 which are unsorted using your program? i tried that using your program, it cums out of the quicksort function please help!!

[Lkwai8]

awesome and simple explaination, just what programming should be about

[Freeeride15]

Thank you very much!! :)

andris from Hungary.

[Mrtoxic01]

good demo ....

[Ashleyuk1984]

That is fucking BULLSHIT !!!!! I could of sorted that list in 5 secs !!!!! Not 7mins 31secs like this fucking FUCKTARD !!!!!!!! Algorithm my arse !!

[tcriminal]

thanks!

[SergiuXxCracker]

Really nice tutorial, i've learned quicksort from the first time i've watched the video, you should do some more algorithms videos :P, and thnx a lot for the tutorial

[cooolway]

Thanks a lot, now I understand it.

[reckterApple]

Great Video! I understand quick sort now! 5*

[DanyAlejandro]

This would be the best quick sort video... if you had more light and a better camera.

[vladb01]

There are actually many implementations of this algorithm, so this is only one of them. My point was just that by visualizing it we can make it easier to comprehend. Other variations can be visualized too though.

[newcoleco]

I did compare your demonstration to the way I did learn quicksort and they both do the same compares and moves except that your example is more easier to follow and less confusing about the 2 pointers... In computer terms, your version is for a list of (link chained) elements, and the version I did learn is for an array of elements.

[charlesguo25]

great demonstration!  Love it