Quick Sort Using Recursion (Theory + Complexity + Code)

In this video, we cover the quick sort algorithm. Including the theory, code implementation using recursion, space and time complexity analysis, along with comparison with merge sort. We also see how in-built sorting algorithms work.

Take part in the learning in public initiative! Share your learnings on LinkedIn and Twitter with #DSAwithKunal & don't forget to tag us!

👉 Resources
- Join Replit: http://join.replit.com/kunal-kushwaha
- Complete Java DSA playlist: https://www.youtube.com/playlist?list=PL9gnSGHSqcnr_DxHsP7AW9ftq0AtAyYqJ
- Code, Assignments, & Notes: https://github.com/kunal-kushwaha/DSA-Bootcamp-Java

➡️ Connect with me: http://kunalkushwaha.com

=========================================
Timestamps:
00:00 Introduction
03:01 What is Pivot?
04:43 Recursive Quick Sort
09:58 How to put pivot at correct position?
17:55 How to pick the pivot?
20:15 Complexity comparison of pivot positions
27:45 Important Notes
29:32 Hybrid Sorting Algorithms
31:49 Code for Quick Sort
39:12 Internal Sorting Algorithm
41:20 Outro

#sorting #placement #dsa #interviews