Uploaded July 2013 | Updated September 2026, 2 weeks ago

---

See complete series on sorting algorithms here:
youtube.com/playlist?feature=edit_ok&list=PL2_aWCzGMAwKedT2KfDMB9YA5DgASZb3U

In this lesson, we have explained Quick sort algorithm and implemented it in C++. Quick sort is a divide and conquer algorithm that has an average case time complexity of O(nlogn).

For more such videos and updates, subscribe to our channel.
You may also like us on facebook:
facebook.com/MyCodeSchool