Sir Very good Explanation i Did not get Bored when i study your lecture sir please can u also upload data structure and any programming language(c or java) tutorial it will help a lot
00:02 Performance of quick sort depends on partition and pivot placement. 01:24 Quick sort worst case time complexity is crucial for competitive exams 02:37 Quick sort algorithm working with already sorted array. 03:40 Initial pass of Quick Sort algorithm explained 04:40 Explanation of partitioning in Quick Sort 05:36 Worst case time complexity of Quick Sort 06:34 Worst case of quick sort is O(N^2) 07:24 Worst case time complexity of Quick Sort is O(N^2)
Bhaiya i am regular viewer, subscriber and sharer of all your videos..kindly upload videos of other subjects of computer science streams also. Thank you
Hello Sir, aapki videos bhot aachi h or bhot aacha pdhate ho. Bs aapko ek feedback dena chata hu ki video me aapki sound thori echo ho rhi h. Vse agre phone me sunte h to tik h pr jb headphone pr sunte h to echo aa rhi h agr echo nh hogi to kafi aacha lgega
Sir, if the array is scanned fully after each pass ,then it will be known that the array is sorted ,then the alorithm should be stopped..but why going to next pass? Please clear my doubt!!
infinity could not be less than pivot. because pivot is a fixed number and infinity is used for the purpose to stop at the condition p(infinity)>pivot always as infinity could not be less than a fixed number. In this case if p and q is crossed q and pivot will be interchanged.
![L-2.3: Recurrence Relation [ T(n)= n*T(n-1) ] | Substitution Method | Algorithm](/img/1.gif)
i want to give this video infinity likes. college wale 1 sem me ye ni smjha pae
Kya baat hai sir ,Maza aa Gaya . Sir aap Hindi me samjhate ho to bahut accha samajta hai.
Finally!! I learnt quick sort properly!!🥰 Thank u sir♥️
Revision
Best case and Average case's time complexity is N( Log N )
Worst case time complexity is 0(n^2)
kdd
How many of you are watching just before exam
Me🤣🤣
Me😂
😂
2 hour before exam broo
🤣🤣🤣🤣
Finally I found quick short video which is most important on the earth 😁😁😁 nice explanation sir you are best ❤️❤️❤️ thankew for this kind of stuff
Sir Very good Explanation i Did not get Bored when i study your lecture sir please can u also upload data structure and any programming language(c or java) tutorial it will help a lot
00:02 Performance of quick sort depends on partition and pivot placement.
01:24 Quick sort worst case time complexity is crucial for competitive exams
02:37 Quick sort algorithm working with already sorted array.
03:40 Initial pass of Quick Sort algorithm explained
04:40 Explanation of partitioning in Quick Sort
05:36 Worst case time complexity of Quick Sort
06:34 Worst case of quick sort is O(N^2)
07:24 Worst case time complexity of Quick Sort is O(N^2)
didnt understood quick sort on my own, watched your video and now I can say, yess !! i know how to do it, Thanks for this amazing video !!!
Apka concept bahut mast hai sir ... samjhane ke liye
Great video, beautiful explanation Sir, thank you so much! :)
HE IS MENTOR OF ALL MENTORS
I never used to comment buy yes im doin this coz its really understandable and ez and quick thnx sir ❤️
Sir thanks for sort message service for brain 👍🏻
Best explanation sir 😍😍
Sir, please Upload compliler design lectures also. It will going to help us a lot.
this man is greater than all my university professors(teachers)
Helpful video sir🙏🙏🙏❤️
Best explanation of quick sort ever😭😭😭🙏
Tu isme rone ki kia bat hai???
@HaniyaKhan-s4t yeh Khushi ke aansu hai !!
Nice sir thanks a lot with great heartlly
finally, quick sort understood thank you, sir
Thanks for covering all the subjects. Do you have any question bank available with you as well?
Excellent 👍👍❣️❣️
Thank you so much sir 🙏😊
No hay problema, es un placer
Por favor, pregunte si tiene alguna consulta
Thankyou sir bhagwan apko khus rakhe🙏
Happy teacher day sir 🌸
Love nd respect from Pakistan 🇵🇰❤️
Bhaiya i am regular viewer, subscriber and sharer of all your videos..kindly upload videos of other subjects of computer science streams also. Thank you
Please explain with algorithms.. It will be then become easier to relate the working with algos.. otherwise very fine teaching
Thank you.. sir, aap bhut achaa padhate h..
Sir u made this concept very easy for us.... effective teaching
Tq sir
Aapne bahut achhe se samjhaya
Sir it will be really great if there will be a playlist of "Algorithms"
Thank god 😌 i successfully learn how to solve worst case... Thank you very much
Sir aap jio hazaro saal ye mare h aarzoo happy birthday to you🎉
Nice explanation bro
Gurujee shandar jabardast zindabad
wahh sir.. crystal clear😘
Aey sir ji mouj kardi
Awesome explanation!!!
Thanks sir
sir please upload the video binary search, heap sort , merge sort divide and conquer approach and their complexity .
Love you sir , Thank-you ❤️
Thanks for your hard work for us ... Sir
Excellent explanation sir
Amazing lecture ❤❤
Thank you so much,!! sir😍
Thank u sir this video gave me more clarification about quick sort..
thankuuuu☺☺
awesome
awesome explanation
Thank u so much sir 😊
sir with code smjhya keryin fr zaida achi smjh ayee gi 🥰
BESTTTTTT!! THANKS A LOT!!!
Gd explanation sir❤️
Awesome sir jiiii...
Thank you sir, you are just awesome
Hello Sir, aapki videos bhot aachi h or bhot aacha pdhate ho. Bs aapko ek feedback dena chata hu ki video me aapki sound thori echo ho rhi h. Vse agre phone me sunte h to tik h pr jb headphone pr sunte h to echo aa rhi h agr echo nh hogi to kafi aacha lgega
Thank you sir...
Nice
Thanks sir g 👍
Thank you sir
Thank you very much
Sir this is best or worst case complexity?
As the video title it tells worst but u have explained best wala case
Thank sir
bhai party 1 million
best ❤
Sir what about the best case
thank you very much for the detailed explanation can i solve the above equation with Masters theorem method... response is highly appreciated
Quick Sort worst case time complexity =O(n^2)
Please complete the playlist of daa
Thankuhh sir finally I got this concept
thanks,sir
description box me toh nahi hai koi bhi link
Worst case time complexity of Quick sort O(n^2)
Thnq sir
sir,please explain it by taking the last element as pivot
Sir , pseudo code bhi daal dete
Sir please add end screen in your videos.
Sir quick sort stable sort hai ya instable sort
Sir, if the array is scanned fully after each pass ,then it will be known that the array is sorted ,then the alorithm should be stopped..but why going to next pass? Please clear my doubt!!
what if we select middle index as a pivot like we do in merge sort
How to choose pivot element and why we choose first element for pivot ..
The answer to your question is that why do we choose A as the first alphabet in English alphabet. In short it is more convenient.
Aree wah sir i love you
Kia baat krty ho sir g
completed
could you please explain the Randomized quick sort?
sir exam ma average case sa hi solve kra quicksort ko tu koi prob tu nhi ha plz tell
Decreasing order k v bana dete n sir
Sir if q is equal to pivot element then what will we do ?
What is the formula for number of comparisons for sorted array in quick sort?
large number of elements k liye random element better hota h sir
sir please teach engineering mathematics!
NPTEL is the best resource, I got A+ at my university in mathematics
15 minutes before exam 😎
What is recurrence relation
👌👌👌
Please gives lecture on pseudo code.
Sir can you please help me with this sorting , using quick sort 9,15,10
5 hr before exams
For extc students there is any gate channel
?
10 mints before ppt 😅😂
Sir what if " p(infinity)
infinity could not be less than pivot. because pivot is a fixed number and infinity is used for the purpose to stop at the condition p(infinity)>pivot always as infinity could not be less than a fixed number.
In this case if p and q is crossed q and pivot will be interchanged.
@@hiramalik3057 thank you I got it very well