Sorting Algorithms Redux 08: Quicksort

One of the more complicated, but more efficient sorting algorithms!

- Intro Theme Adapted From -
Licensed under Creative Commons: By Attribution 3.0
ISRC: USUAN1100879

= 0612 TV =

Enjoy your stay, and don't hesitate to drop me a comment or a personal message to my inbox =) If you like my work, don't forget to subscribe!

= NERDfirst =
NERDfirst is a project allowing me to go above and beyond YouTube videos into areas like app and game development. It will also contain the official 0612 TV blog and other resources.

-----

Disclaimer: Please note that any information is provided on this channel in good faith, but I cannot guarantee 100% accuracy / correctness on all content. Contributors to this channel are not to be held responsible for any possible outcomes from your use of the information.

[danc]

This is one of the best videos I've seen on quicksort by far. You should continue posting algorithms videos, they say that the best way to learn something is by teaching.

[mjmartinez]

This is the most clear and understandable demonstration of quicksort I've seen.. I've been searching, and all of them are confusing. Thanks !

[NERDfirst]

Hello and thank you so much for your comments! Glad you liked my videos =)

[frames]

You know, your explanation is so clear and precise, I understood this in 9 minutes what I was unable to understand for a month. Thanks.

[buddyleeorg]

Your explanations are clear. I appreciate how you take time to clarify your terms. Thanks for doing the hard work to create these videos.

[krytek]

Best explanation ever. I couldn't understand it for a week until I saw this video.
Thank you so much.

[CiscoASR]

Of the twenty or so videos on Quick Sort your is the best and most thorough explanation. Good job !

[NERDfirst]

Hello and thank you so much for your comment! Glad to be of help!

[NERDfirst]

Hello and thank you for your comment! Glad you found my work helpful =)

[NERDfirst]

Hello and thank you very much for your comment! Very happy to be of help! =)

[matthewross]

You are my savior, my light in the dark sky, getting me through Finals.  Someone give you a raise

[NERDfirst]

Hello and thank you so much for your comment! Glad you liked my work =)

[NERDfirst]

Hello and thank you very much for your comment! I'm very happy to be of help! =)

[NERDfirst]

Hello and thank you for your comment! This is a great question, and something I never really thought of.

When you do quicksort with a random pivot, the left pointer still moves in first. In the event of a swap not involving the pivot element, both left and right pointers move in towards each other once without comparison, before continuing the process with the opposite pointer.

For a clearer picture, look for "Quicksort" on wikipedia. There is an animated GIF in the "Simple Version" section.

[NERDfirst]

Hello and thank you for your comment! I'm very happy to be of help, and I'm very glad to know I've achieved what I set out to do.

Sorry for the late reply on this. YouTube flagged it as spam.

[NERDfirst]

Hello and thank you very much for your comment! I'm happy to be of help =)

[chaozkreator]

wow, you're amazing! I've had so much difficulty understanding sorting algorithms, especially the more complicated ones like quicksort, merge & heap sort. All of the Google results I've found are too complicated to understand, and there aren't many decent ones out there with visualization like yours. So ya, thanks for making these videos!

[KPO]

I must mention your videos to my computer science professor. Well-done!

[NERDfirst]

Hello and thank you for your comment! Glad you found this helpful =)

[NERDfirst]

Hello and thank you very much for your comment! Glad you liked the video =)