Analysis of quicksort

See complete series on sorting algorithms here:

In this lesson, we have analyzed time and space complexity of quick sort algorithm as well its other properties.

Series on time complexity analysis:

Lesson on space complexity analysis of recursion:

For more such videos and updates, subscribe to our channel.

You may also like us on facebook:

[cheems]

Time to time i find myself coming back to your videos, sometimes for revision, sometimes for just interest and I never leave unsatisfied. These videos although are free, but are of premium quality. Better than paid courses

[tamara-kurosimonalale]

Incredible how your explanation made quicksort algorithm and its analysis so easy

[rafaelfonseca]

14:30
As *n - k = 1*, then *k = n - 1*.
Thereby, we will have a slightly different final result for this calculation:
(n ^ 2 * c + n * c - 2 * c) / 2 + c1
Anyway, we conserve the fact that this algorithm takes n ^ 2 of cost in the worst case.
Awesome video teacher!
Super enjoyed!

[tejasjoshi]

2 days ago j learned about merge sort and quick sort, but at today morning I thought that I hadn't got the exact logic or idea to solve them, so I decided to learn from your channel and just completed and boom💥, I am satisfied with the explanation (deep explanation) tha k u for making such brilliant videos🔥❤️

[praveenreddykatta]

I should say your videos are the best in making the things simple and understandable. Please upload more videos

[romxstar]

thank u sooo much we just did it in school .. and i wanted to revise it and here u are uploading the video of it

[yiningli]

built more confidence in challenging google from your lectures, thx !

[harshalisatwani]

Please upload video lectures on hashing, heap sort, bucket sort and shell sort as well.. These videos have really proved very helpful in understanding sorting algos in a better way..

[BhagwanJoshi-technocrat]

I loved the way you explained all sorting algorithms and its analysis. If you can add heap sort and radix sort in this list, that would be very helpful.
Thanks :)

[gozi]

Thank you so much for this video!!! This has to be by far the most helpful CS programming learning video, that I have ever watched.

[SadiqKhan]

Amazing lectures and best way of describing things with programs and complexity analysis for every one. I am waiting for next sorting like heap, redix etc. Please please upload those too.

[bahdjibrildjibril]

Amazing series. It took me less that 2 hours to revise what used to take days for me.. .Best Way of teaching.

[amrousimen]

very thanks, you are the best teacher for algorithmic on youtube

[hangchen]

I'm addicted to your lessons... so after 4 years, are there still more?? :)

[rafaelfonseca]

Teacher, at minute 17:06 we cannot forget of adding a return statement into RandomizedPartition as follows:
RandomizedPartition(A, start, end)
{
pivotIndex <-- random(start, end)
swap(A[pivotIndex], A[end])
*return* Partition(A, start, end)
}

[camuflagehugo]

your videos are much better than those on coursera!

[Utkarshkharb]

17:53 if the pivot lies at index i, then there are i elements in the left partition and n-1-i elements in the right partition(In a 0-based indexing)

[AmiParikh]

Superbly explained! Thank you for these videos. I have an algorithm interview, hope this helps.

[PK-enbm]

Nice video :) Really helped me...
Just one thing though: RandomizedPartition() should return pIndex to QuickSort() call, so I think Partition() inside RandomizedPartition() should be called as "return Partition()"

Thank s for making such hugely helpful videos, keep up the good work...

[DahliaRich]

this is great. thanks so much. couldn't understand a word of what the instructor at school said. you explained perfectly.