Quick Sort Algorithm - Concept, Code, Example, Time Complexity |L-7||DAA|

[@gowthamjadapalli9458]

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

[@MURALIKRISHNANIMMAGADDA-ur7mn]

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

[@nasimajosefi]

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

[@vinayakdiwase5416]

In the last step ...........pivot is not an index ..............it's an variable..............so store the index of pivot into a variable as k=0 And then the swapping will be done as follows Temp=a[j]; a[j]=a[k]; a[k]=a[Temp];

[@sammushaik-lb2rv]

you explain great mam,thankyou somuch😊

[@IBRAHIMIMRAN-z3b]

It was wonderful explanation maam

[@029bryandavid7]

You are God awesome explanation 👍👍🔥

[@neeliparameshwari1673]

Perfect explanation! thankyou mam.

[@MallikaB-ex7in]

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

[@coding_with_bf]

Both mam and explanation are cute ❤❤❤

[@TroubleFreevideos]

Thanks a lot 😊

[@swapnildevkate5380]

dsa rizzzzzz damn

[@gowtham12365]

Thanks a lot mam❤🎉

[@lovelyfamily4886]

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

[@yashureddy42]

yes exactly!!

[@vinayakdiwase5416]

That's correct

[@Aniketkumar-xx1fh]

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

[@antoinegriezmann8040]

Thank you so much mam🥺

[@bhavibannu8098]

Having xam tomorrow

[@megharaghu-b1u]

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

[@GeethaSriChekka]

Thank you so much mam

[@bhavibannu8098]

Pls solve the problem and share am getting confused

[@sandhyaranisahu341]

Nice explanation thank u

[@maneeshalenin]

very helpful video

[@Mememode89]

Attendence for 1 day before exams😂

[@joesamuelkorati3997]

good explanation👌

[@RachuSrinivas-gk8kj]

What if pivot element is less than i and j is not greater than pivot element

[@divyaanshuagrawal3383]

Thanks mam.

[@RachuSrinivas-gk8kj]

Plz olz plz plz explain topological sorting algorithm

[@vigneshvaspari9808]

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

[@sammushaik-lb2rv]

your wish you take pivot as starting postion or ending position or middle position or any random position bro ok

[@Krishnapreethi-q5t]

Explain us Boyer and moor algorithm and also kmp😊😊😊plz

[@218katravathkeerthi6]

Mam can u upload videos from 17 to 25 🙏

[@ThalathMohammedthalath]

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

[@wonderfulfactsoftheworld1173]

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

[@marrapumani]

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

[@shaju9415]

Mam can u solve last two steps and share the answer plz

[@mohammedrahila5874]

Mam please scripting language subject

[@TeluguMoviesHD6303]

❤

[@KulasekharThimmidi]

problem complete chai

[@sunaishmithanarra]

jenny mam lectures ni follow avutaru kadha miru same example hepparu

[@vedantvs9220]

Thank you so much mam

[@Harshaharsha-k8v]

thank you mam