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 ! 😔
@babjssk4 жыл бұрын
Fee university me deta hu aur knowledge yha se thx
@anasmir23152 жыл бұрын
Thanks
@kallurishyamsundhar71953 жыл бұрын
actually we move the left but after some steps u have started to move right why that thing happen
@tundergamers63642 жыл бұрын
Mam please 🙏 use board mam don't waste paper 🙏🙏
@MrAditya-xm1pn Жыл бұрын
this is amazing how easily you describe thanks for your help.
@marlapudimanoj86684 жыл бұрын
Why did u take right bound to left bcz its higher did u take like that mam
@princysingh6916 Жыл бұрын
Same question
@rajanikour1818 Жыл бұрын
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!
@yaardixit980911 ай бұрын
thanks bhai ye mast tha ye apne class ke sabhi bacho ko dikhaunga it will help them for sure😂💗
@yaardixit980911 ай бұрын
substitution method ka kr skte ko?
@nipendersingh30623 жыл бұрын
madam suhagraat ke turant baad start kar diya kiya?
@yellasirimadhusmitha27963 жыл бұрын
Really it helped me a lot for examination mam.. Thank you mam
@jaikrish505 жыл бұрын
Mam ur class and your Mehdi very nice
@madhumadapala56864 жыл бұрын
Onces you have shown your face
@JavaAidTutorials5 жыл бұрын
Nice video
@Safal_here10 ай бұрын
you are teaching in wrong way must shift right pointer too
@roshnimansore35814 жыл бұрын
mem partition ka algorithm kaha he please mem uska bhi algorithm banaiye
@prakashconsultancy3 жыл бұрын
in 3 case if p less than l what we have to do
@anushakakinada33723 жыл бұрын
Nice xplaination😄😇mam
@pavanipavani94304 жыл бұрын
Thank u mam for giving nice explanation
@shubhamchaturvedi-z8r11 ай бұрын
Ma'am kab left se compare karna hai kab right se samajh nahi aa raha hai
@visweshkumar14324 ай бұрын
Nice explanation mam keep going...😊🤗
@revathiselvaraj20874 жыл бұрын
Mam it's nice ......
@menapatigowrishankar62364 жыл бұрын
Madam nice expalnation.but you no need to say sorry some mistakes we can while solving
@babjssk4 жыл бұрын
Right
@vijayad81194 жыл бұрын
Nice explanation mam
@gangaj40424 жыл бұрын
thank you so much
@YilkalTefera Жыл бұрын
why your hand is overcolored?
@patelvraj13623 жыл бұрын
thank you for sharing your experience with us
@HemanthKumar-yk8iy4 жыл бұрын
Thanks
@oldspiritualsongs20553 жыл бұрын
thanks
@kutarevijay65694 жыл бұрын
mam I saw vedio to see ur mehndi design
@subhasishbhowmick89123 жыл бұрын
Legend spotted😂
@rameshnaniify2 жыл бұрын
Nice explanation
@areya11k73 жыл бұрын
Mai kya thekhu yaar lecture ya #mehdi. ...
@rimpa30263 жыл бұрын
Thank u mam
@dadiarun63852 жыл бұрын
Tqq mam
@shetty5121 Жыл бұрын
How u took pivot?
@yaardixit980911 ай бұрын
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 .
@shailendraverma18083 жыл бұрын
this is wrong, how would you apply this for 5,40,10,20
@SurajMaurya-qt7ns3 жыл бұрын
wowwhh ma’am apne mendhi lagai h 😱😱😂😂
@AkashdeepDam4 жыл бұрын
Very beautiful mehndi, mam... Nice explanation...😊