Quick Sort Algorithm - Concept, Code, Example, Time Complexity |L-7||DAA|
Вставка
- Опубліковано 11 лип 2023
- Abroad Education Channel :
/ @shraavyakatkuri4078
contact me on gmail at : shraavyareddy810@gmail.com
Contact me on instagram at : / shraavya_katkuri
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
One of the best explanation for quicksort, thank you for your excellent explanation
The best explanation ever.lot's of love for your work ❤.
Perfect explanation! thankyou mam.
Mam can you please solve the whole problem and share the solution.....
You are God awesome explanation 👍👍🔥
good 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
Nice explanation thank u
Mam small doubt can we take any of the elements in the array as pivot element
very helpful video
Thank you so much mam
Thank you so much mam🥺
Thanks mam.
thank you mam
Both mam and explanation are cute ❤❤❤
Thanks a lot 😊
dsa rizzzzzz damn
Thankyou so much very much very good very very thanks 😮❤❤😅😅😅❤❤❤❤
Pls solve the problem and share am getting confused
❤
Having xam tomorrow
Attendence for 1 day before exams😂
Mam can u upload videos from 17 to 25 🙏
Quick sort I need last explanation completely I mean explain lastly part with solution
Mam can u explain the last two steps and share the solution pls
Mam please scripting language subject
problem complete chai