Quick Sort is a really popular but at the same time a little tricky algorithm to perform sorting. It is used extensively so that your code runs faster. Quick Sort uses Recursion and the Divide and Conquer algorithmic paradigm. As per the name, this method should be very quick. But what makes it so fast? What is happening behind the scenes. In this video I perform a live demo to show that to you, and then do a step by step walkthrough of the code to do a dry-run. This way the concept will stay in your mind forever.
00:00 - Intro
01:40 - Advantages of Quick Sort
03:00 - Live Demo of Quick Sort
11:00 - Actual implementation and dry-run
17:46 - Final thoughts
My favorite book on Introduction To Algorithms: amzn.to/35RrVuK
📚 Links I talk about in the video:
Bubble Sort: • Bubble Sort Algorithm ...
Insertion Sort: • Insertion Sort visuali...
Selection Sort: • Selection Sort | Live ...
Divide and Conquer Algorithm: • Divide and Conquer alg...
Recursion Algorithms: • Recursion paradigms wi...
📘 A text based explanation is available at: studyalgorithms.com/array/qui...
Code on Github: github.com/nikoo28/java-solut...
Test cases: github.com/nikoo28/java-solut...
🔗 To see more videos like this, you can show your support on: www.buymeacoffee.com/studyalg...
💻 Get Social 💻
Follow on Facebook at: / studyalgos
Follow on Twitter at: / studyalgorithms
Follow on Tumblr at: / studyalgos
Subscribe to RSS feeds: studyalgorithms.com/feed/
Join fan mail: eepurl.com/g9Dadv
#algorithms #sorting #tutorial