Time and Space Complexity Analysis of Quick Sort

Lesson 5 of 9 • 2 upvotes • 10:24mins

Ayushman Tiwari

Quick Sort uses Partition Algorithm so firstly the analysis of Partition Algorithm is done. Time Complexity & Space Complexity of Quick Sort varies significantly comparing to Merge Sort in different cases. Quick Sort behaves worse when input is already sorted. The in-depth analysis is done in lesson for Worst, Best & Average Cases for both Time & Space Complexity. Hope you are enjoying this course. Have an awesome day :)