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

preview_player
Показать описание
Abroad Education Channel :

Рекомендации по теме
Комментарии
Автор

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

gowthamjadapalli
Автор

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

MURALIKRISHNANIMMAGADDA-urmn
Автор

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

nasimajosefi
Автор

you explain great mam, thankyou somuch😊

sammushaik-lbrv
Автор

Mam can you please solve the whole problem and share the

megharaghu-bu
Автор

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

marrapumani
Автор

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

vigneshvaspari
Автор

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

MallikaB-exin
Автор

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

lovelyfamily
Автор

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

RachuSrinivas-gkkj
Автор

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

Aniketkumar-xxfh
Автор

Pls solve the problem and share am getting confused

bhavibannu
Автор

Mam can u upload videos from 17 to 25 🙏

katravathkeerthi
Автор

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

wonderfulfactsoftheworld
Автор

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

shaju
Автор

Plz olz plz plz explain topological sorting algorithm

RachuSrinivas-gkkj
Автор

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

Krishnapreethi-qt
Автор

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

ThalathMohammedthalath
Автор

jenny mam lectures ni follow avutaru kadha miru same example hepparu

sunaishmithanarra
welcome to shbcf.ru