Neeche diya gaya hai Quick Sort algorithm ka ek example Hindi mein: Sochiye humare paas ye list hai: [6, 8, 3, 9, 2, 5] Kadam 1: Ek pivot element chunein (is case mein, aakhri element 5 chunte hain). Kadam 2: Pivot ke aas paas list ko partition karein. Pivot se chote sabhi elements ko pivot ke baayein aur pivot se bade sabhi elements ko pivot ke daayein shift karein. Partitioning Kadam: [2, 3, 5, 9, 8, 6] Kadam 3: Quick Sort algorithm ko recursive tareeke se pivot ke dono taraf wale sublist par lagu karein. Baayein wala sublist: [2, 3] Daayein wala sublist: [9, 8, 6] Baayein wale sublist aur daayein wale sublist ke liye Kadam 1-3 ko phirse repeat karein. Baayein wale sublist ke liye: Ek pivot element chunein (is case mein, pehla element 2 chunte hain). Partitioning Kadam: [2, 3] Baayein wala sublist pehle se hi sorted hai kyunki usmein sirf ek element hai. Daayein wale sublist ke liye: Ek pivot element chunein (is case mein, aakhri element 6 chunte hain). Partitioning Kadam: [6, 8, 9] Daayein wala sublist pehle se hi sorted hai kyunki usmein teen elements hai. Kadam 4: Sorted sublists ko combine karein. Sorted list unsorted baayein wale sublist, pivot element, aur unsorted daayein wale sublist ko jodkar banai jati hai. Result: [2, 3, 5, 6, 8, 9] Quick Sort ka istemal karke sorted list banegi [2, 3, 5, 6, 8, 9]. Quick Sort mein mukhya tatva hai pivot element chunna, partitioning karna aur fir us partition ko recursively sublist par lagana, jab tak puri list sort hojaye. Quick Sort ka fayda hai ki iska average-case time complexity O(n log n) hota hai aur ye in-place sorting hai, matlab iske liye alag se memory ki zaroorat nahi hoti hai. Halaanki, Quick Sort ka worst-case time complexity O(n^2) ho sakta hai agar pivot selection sahi nahi hai, jiski wajah se kuch scenarios mein inefficient sorting ho sakti hai. Mujhe ummeed hai ki ye example aapko Quick Sort algorithm samajhne mein madad karega. Agar aapke paas koi aur sawal hai toh zaroor puchiye!
Padhana nai aata to kyu aate ho exam se pehle ka time waste karne ....faltu panti ki he algorithm and example dono me .... successfully wasted my time before exam ! 😔
there are two best ways we can pick pivot 1st one is by selecting middle element of an array as an pivot 2nd one is by selecting random element of an array as an pivot .
![ถามตรงๆ กับ อาจตุพร ทำไม ประเทศไทย ใครเป็นนายก ก็โดนด่า พอออกเเล้วคนคิดถึง!!?? l [Nickynachat]](http://i.ytimg.com/vi/3YFLMXxBGAs/mqdefault.jpg)
Wonder why quick sort is referred as quick🤔
Haha same here
Same here
@@anasmir2315 same here in summers
Even I as so complex
Because it's not a quickest algorithm to learn
this is amazing how easily you describe thanks for your help.
actually we move the left but after some steps u have started to move right why that thing happen
Really it helped me a lot for examination mam.. Thank you mam
Mam ur class and your Mehdi very nice
Fee university me deta hu aur knowledge yha se thx
Thanks
mam your method of teaching is so good
thank you for sharing your experience with us
Why did u take right bound to left bcz its higher did u take like that mam
Same question
Nice explanation mam keep going...😊🤗
Thank u mam for giving nice explanation
Mam it's nice ......
thank you so much
Nice xplaination😄😇mam
Mam please 🙏 use board mam don't waste paper 🙏🙏
Nice explanation mam
in 3 case if p less than l what we have to do
Thanks
Nice video
Nice explaining
madam suhagraat ke turant baad start kar diya kiya?
thanks
Thank u mam
Tqq mam
Neeche diya gaya hai Quick Sort algorithm ka ek example Hindi mein:
Sochiye humare paas ye list hai: [6, 8, 3, 9, 2, 5]
Kadam 1: Ek pivot element chunein (is case mein, aakhri element 5 chunte hain).
Kadam 2: Pivot ke aas paas list ko partition karein. Pivot se chote sabhi elements ko pivot ke baayein aur pivot se bade sabhi elements ko pivot ke daayein shift karein.
Partitioning Kadam: [2, 3, 5, 9, 8, 6]
Kadam 3: Quick Sort algorithm ko recursive tareeke se pivot ke dono taraf wale sublist par lagu karein.
Baayein wala sublist: [2, 3]
Daayein wala sublist: [9, 8, 6]
Baayein wale sublist aur daayein wale sublist ke liye Kadam 1-3 ko phirse repeat karein.
Baayein wale sublist ke liye:
Ek pivot element chunein (is case mein, pehla element 2 chunte hain).
Partitioning Kadam: [2, 3]
Baayein wala sublist pehle se hi sorted hai kyunki usmein sirf ek element hai.
Daayein wale sublist ke liye:
Ek pivot element chunein (is case mein, aakhri element 6 chunte hain).
Partitioning Kadam: [6, 8, 9]
Daayein wala sublist pehle se hi sorted hai kyunki usmein teen elements hai.
Kadam 4: Sorted sublists ko combine karein. Sorted list unsorted baayein wale sublist, pivot element, aur unsorted daayein wale sublist ko jodkar banai jati hai.
Result: [2, 3, 5, 6, 8, 9]
Quick Sort ka istemal karke sorted list banegi [2, 3, 5, 6, 8, 9].
Quick Sort mein mukhya tatva hai pivot element chunna, partitioning karna aur fir us partition ko recursively sublist par lagana, jab tak puri list sort hojaye.
Quick Sort ka fayda hai ki iska average-case time complexity O(n log n) hota hai aur ye in-place sorting hai, matlab iske liye alag se memory ki zaroorat nahi hoti hai.
Halaanki, Quick Sort ka worst-case time complexity O(n^2) ho sakta hai agar pivot selection sahi nahi hai, jiski wajah se kuch scenarios mein inefficient sorting ho sakti hai.
Mujhe ummeed hai ki ye example aapko Quick Sort algorithm samajhne mein madad karega. Agar aapke paas koi aur sawal hai toh zaroor puchiye!
thanks bhai ye mast tha ye apne class ke sabhi bacho ko dikhaunga it will help them for sure😂💗
substitution method ka kr skte ko?
Tnq mam
Ma'am kab left se compare karna hai kab right se samajh nahi aa raha hai
Very beautiful mehndi, mam... Nice explanation...😊
mam I saw vedio to see ur mehndi design
Legend spotted😂
Nice explanation
mem partition ka algorithm kaha he please mem uska bhi algorithm banaiye
Padhana nai aata to kyu aate ho exam se pehle ka time waste karne ....faltu panti ki he algorithm and example dono me .... successfully wasted my time before exam ! 😔
Madam nice expalnation.but you no need to say sorry some mistakes we can while solving
Right
why your hand is overcolored?
How u took pivot?
there are two best ways we can pick pivot
1st one is by selecting middle element of an array as an pivot
2nd one is by selecting random element of an array as an pivot .
Onces you have shown your face
this is wrong, how would you apply this for 5,40,10,20
wowwhh ma’am apne mendhi lagai h 😱😱😂😂
Mai kya thekhu yaar lecture ya #mehdi. ...
you are teaching in wrong way must shift right pointer too