0:00 to 0:34 intro 0:35 to 1:56 brief explanation 1:56 to 10:19 partition explanation 10:20 to 11:34 quick sort algorithm 11:35 to 12:40 dividing array 12:41 to14:39 partition algorithm 14:40 16:00 dividing array

In swapping pivot and a[j ] I think it is not a[ pivot ] its just pivot

Mam can you please solve the whole problem and share the solution.....

The best explanation ever.lot's of love for your work ❤.

One of the best explanation for quicksort, thank you for your excellent explanation

Perfect explanation! thankyou mam.

You are God awesome explanation 👍👍🔥

Mam you didn't pass n in parameters list but how can you assign n-1 to j that means for each invoke of partition algorithm we can partition whole array not sub array

Mam small doubt can we take any of the elements in the array as pivot element

Thank you so much mam....Your explanation is very good 😊 👍

good explanation👌

Nice explanation thank u

Plz olz plz plz explain topological sorting algorithm

Pls solve the problem and share am getting confused

Mam can u upload videos from 17 to 25 🙏

Having xam tomorrow

Thank you so much mam🥺

very helpful video

Attendence for 1 day before exams😂

Thank you so much mam

Thankyou so much very much very good very very thanks 😮❤❤😅😅😅❤❤❤❤

Quick sort I need last explanation completely I mean explain lastly part with solution

Thanks mam.

thank you mam

❤

Mam please scripting language subject

Mam can u explain the last two steps and share the solution pls

Both mam and explanation are cute ❤❤❤

problem complete chai