ขนาดวิดีโอ: 1280 X 720853 X 480640 X 360
แสดงแผงควบคุมโปรแกรมเล่น
เล่นอัตโนมัติ
เล่นใหม่
0:00 to 0:34 intro0:35 to 1:56 brief explanation 1:56 to 10:19 partition explanation10:20 to 11:34 quick sort algorithm11:35 to 12:40 dividing array 12:41 to14:39 partition algorithm 14:40 16:00 dividing array
One of the best explanation for quicksort, thank you for your excellent explanation
Mam small doubt can we take any of the elements in the array as pivot element
your wish you take pivot as starting postion or ending position or middle position or any random position bro ok
In swapping pivot and a[j ] I think it is not a[ pivot ] its just pivot
yes exactly!!
Thank you so much mam
Quick sort I need last explanation completely I mean explain lastly part with solution
jenny mam lectures ni follow avutaru kadha miru same example hepparu
Attendence for 1 day before exams😂
Mam can u solve last two steps and share the answer plz
Mam can you please solve the whole problem and share the solution.....
you explain great mam,thankyou somuch😊
Pls solve the problem and share am getting confused
The best explanation ever.lot's of love for your work ❤.
Having xam tomorrow
Both mam and explanation are cute ❤❤❤
Thanks a lot 😊
dsa rizzzzzz damn
It was wonderful explanation maam
Mam can u upload videos from 17 to 25 🙏
Mam can u explain the last two steps and share the solution pls
Plz olz plz plz explain topological sorting algorithm
Thank you so much mam....Your explanation is very good 😊 👍
Mam please scripting language subject
Thanks a lot mam❤🎉
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
What if pivot element is less than i and j is not greater than pivot element
Explain us Boyer and moor algorithm and also kmp😊😊😊plz
Perfect explanation! thankyou mam.
Thankyou so much very much very good very very thanks 😮❤❤😅😅😅❤❤❤❤
good explanation👌
You are God awesome explanation 👍👍🔥
problem complete chai
Thank you so much mam🥺
Nice explanation thank u
thank you mam
very helpful video
Thanks mam.
❤
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
One of the best explanation for quicksort, thank you for your excellent explanation
Mam small doubt can we take any of the elements in the array as pivot element
your wish you take pivot as starting postion or ending position or middle position or any random position bro ok
In swapping pivot and a[j ]
I think it is not a[ pivot ] its just pivot
yes exactly!!
Thank you so much mam
Quick sort I need last explanation completely I mean explain lastly part with solution
jenny mam lectures ni follow avutaru kadha miru same example hepparu
Attendence for 1 day before exams😂
Mam can u solve last two steps and share the answer plz
Mam can you please solve the whole problem and share the solution.....
you explain great mam,thankyou somuch😊
Pls solve the problem and share am getting confused
The best explanation ever.lot's of love for your work ❤.
Having xam tomorrow
Both mam and explanation are cute ❤❤❤
Thanks a lot 😊
dsa rizzzzzz damn
It was wonderful explanation maam
Mam can u upload videos from 17 to 25 🙏
Mam can u explain the last two steps and share the solution pls
Plz olz plz plz explain topological sorting algorithm
Thank you so much mam....Your explanation is very good 😊 👍
Mam please scripting language subject
Thanks a lot mam❤🎉
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
What if pivot element is less than i and j is not greater than pivot element
Explain us Boyer and moor algorithm and also kmp😊😊😊plz
Perfect explanation! thankyou mam.
Thankyou so much very much very good very very thanks 😮❤❤😅😅😅❤❤❤❤
good explanation👌
You are God awesome explanation 👍👍🔥
problem complete chai
Thank you so much mam🥺
Nice explanation thank u
Thank you so much mam
thank you mam
very helpful video
Thanks mam.
❤