Analysis of Quick Sort Algorithm | Time complexity of Quick Sort Algorithm | O(n^2) | O(n log n)

This video will give you an in depth analysis of quick sort algorithm.
Best case - O(n log n)
Worst Case - O (n^2)
Average Case - O(n log n)

[cstalksbylee]

Hi all,
If you have any doubt or query, feel free to write a comment ✍️ to clarify it.

[rishipollai]

One of the best lecture ever, 🔥 always I am bit confusing with time complexity, now it is totally clear 🤗 thanks to u mam, I really appreciate you efforts 🤗 keep doing such good explanations .

[dhirajtaneja]

Ma'am Your Explanation is the best I've found compared to websites and other videos .

[gursimransingh]

Completely understood!
I have never seen such a clean explanation about complexities of the algorithms.
Please upload more videos especially a playlist on learning complexities from basic to advance problems.

[vishalsingh]

Thank u so much. I wasn't able to understand this but after seeing ur video finding time complexity seems easier.🙏

[UnknownWell-Wisher]

The lecture was to the point with proper

[reetikbahadur]

you r a good teacher 😇😇
Your teaching skill is way better than other😄

[sulthanmogal]

nicely explained worst case where many did not ! thanks..

[akilprasathr]

completely understood!! nice and clean video.

[jathebest]

Thank you so much for helping me understand this basic concept :)

[jhaganb]

Ma'am your explanations was super clear, and highly expect such a good analysis for other algorithms too :)

[silvial]

Hi!!! You're helped me a lot, your video is very clear :^) thank you ✨

[jagadishck]

please do video on average case analysis for quick sort

[ashishksinghal]

Can you also provide analysis of decending array worst case

[quyeto]

with n=8; is there any chance we can generate best case array for a quick sort algorithm, please clarify? thank you. for example, we choose pivot as middle of array.

[AdrijaPal-oxbq]

Why the sum is 2+3+4+5+6+7.... Jab waha par right sub tree me sirf 16 he...to tab to 1 hona chahiye?

[kuchipudivijayrahul]

I don't know why your channel has few subscribers

[deepanshumehlawat]

so does that mean that the worst case will change to nlogn if we take the median as pivot????

[LokeshKumar-jgmd]

Nice explanation but where's the AVG case

[AnuNaik-nuct]

mam for average, when we say quicksort algorithm is average