A Complete Overview of Quicksort (Data Structures & Algorithms #11)

Here's my introduction to / overview of the quicksort / quick sort algorithm!

[rickvian]

I love how you hide all the code to avoid overwhelming

[retr]

Man I’m so glad that you decided to continue these series. I love these series. So educational and so simple unlike other textbooks. Please keep these going. Thanks YK.

[gyantime]

Sometimes he knowingly makes mistake to teach how to deal with it. Salute to him

[ankithans]

I love the way u teach.
Pls continue this series...

[yasaswinitirumanyam]

Please complete all the other datastructures, we are waiting for that

[raevenbauto]

Please continue to make data structures and algorithms simple. Among all the videos I watched this has the best explanation.

[isabelleseah]

Thank you for putting this series together, it's been an absolute life saver!!

[xueqianchen]

This explanation is so good that i wanna cry...i've watched tons of videos of quicksort and still confused. But after watching the overview explanation, not even the pseudocode yet, i'm able to code it out correctly! THANK YOU!

[arjunthecoder]

CS Dojo, the visuals in this video are great!

[alive-official]

I've been waiting for this new episode of your series thank so much for uploading

[vishalialahappan]

Please continue to do this great job. You are teaching so creatively. ❤️

[coderslab]

Thank you so much for your hard work!!!! Your vids are so helpful, and helped me understand better than most other people have. Also, i watched most of your videos and i wanted to say i really appreciate your sense of humour and the jokes, they make you even more enjoyable to learn from :)

[elixpo]

Thank you for this update .... I was looking forward for this.. keep inspiring

[warnercooler]

Thank you so much for the most complete and well presented explanation I have come across so far!

[TharaMesseroux]

Thank you CS Dojo! Very well explained!

[Ryclic]

Keep these videos going, they are extremely helpful!

[professorfontanez]

I compared this implementation to the one used by Gayle Laakman McDowell in her Quicksort video (by calculating the number of passes of each implementation) and found this approach to be slightly more efficient using arrays with all duplicates, some duplicates and no duplicates. Since in both cases the selection of the pivot is somewhat random, I deduced that the placement of the pivot in the middle (5:30) of the two regions contributed to this slight improvement.

UPDATE: What I mean with the relocation of the pivot, is that Gayle's approach picks the middle index as the pivot before swapping values rather than setting the pivot to the middle after the swap.

[diegodesouza]

Love from Brazil! My name is Diego and i really love the CS Dojo lessons...even with this huge amount of knowlegment He is able to teach everything in the way We can understand!

[emayanvadivel]

Awesome keep going with more data structures and algorithms tutorials...eagerly waiting for future upcoming videos

[coding_tips]

Thank you please continue this series. Your explanations are very good.