7.6 Quick Sort in Data Structure | Sorting Algorithm | DSA Full Course

Thank you soo much for this amazing explanation...all my life i was afraid of these dsa concept because my college teacher considered that i cannot pass this subject...and that fear always stayed with me... today got the courage to watch this video and im glad that i did that
.. thank you jenny for this wonderful explanation and removing my fear... ur an amazing teacher...we should get more such teachers like u in university... .

mam please give ur number to me

i am kind of confused, how it is swapping 10 with 7 when 10 <- start index and 7<- end index and in your code it says if (start < end) {swap(a[start], a[end] )}, it should be if (start > end) .

Bra colour red

Thanks a lot mam understood everything

Thanks mam very good explanation

Here lb and ub are 7 so first conditions it is failing then how program will work

you are so cute mammm

Ma'am do you teach design and analysis of algorithm

really she is better in explaining things easily.......................thanku mam

<3<3<3<3<3<3<3<3

Mein jab end aur start ek hi index per ho tab kiya krna hai plz reply

Thank you for explanation. but there is an error in program. while incrementing i , check a[i]<=pivot && i<h

Where is quick sort algo in this?

Thank you madam... from Bangladesh

Nice Explanation as always ❤

Your voice is so beautiful ma'am whenever I listen I feel reliefe❤

I think pivote element should get swapped if Stat is greater end, I think u missed in vieo

THANKS MAM....YOU HAVE CLEARED EVERY SINGLE STEPS....AND THE EXPLANATION OF THE ALGORITHM PART WAS JUST AWSOMEEEE MAM.....AGAIN THANK YOU VERY MUCH MAM.....

Maam can we use end>=pivot or only > is used

Mam, No words to explain your teaching ...🙂🙂
The way you explain each and every step is simply superb...
Your patience is on next level mam..🔥🔥🔥

Thank you so much ma'am. The explanation which I was searching for, I got it from you.



Thank you for explaining so well.💖

Tomorrow My seminar in my college I am explaining Quick sort anfyour code is My code is match so after watching this video My concept is clear for last function call Quick(a,low,j-1);
Quick(a,j+1,high);


thnx mam❤

thankyou thankyou thankyou dA❤❤❤

angrej chal gye lakin angaraji bhasa chor gye...

❤

super mam

Thank You mam for this wonderful lecture

Mam what l would do when end cross the start and pivot element becomes end element how would swapping

I was having so much trouble understanding this thank you for explaining it so well Jenny!

Really I'm very happy because I'm understand clearly thank you so much.

Beauty with brain ❤😘🥰

dont know why but if you remove the this line "swap (a[LB],a[end])" and just return end the code still works?🤔🤔🤔

Bohot badiya explanation ❤✌🏻
Ye madam toh ek crore subscribers deserve karti Hain, she's beautiful as well as talented!
Thank you ma'am for that tremendous level of clarity 💕

Beautiful mam

Thank you so much mam. tomorrow my lab exams is their .yóur teaching help my exams again and again I thank yoú .

Apply quick sort for elements 1 4 2 5 3

What are the uses for quick sort

Mam you make other subjects playlist for ugc net mam

hlo where is swap function in the code

I love her teaching method

Legends watching one day before exams😂

mam you are just awesome!

Every one facing issue in that code their is lit bit correction in pseudo code
in partition method the value of start must be lb+1;
(start = lb+1)
After doing this you will not face any error in code

Mam superb thanks a lot in 2023 im learning

Please take complex example such as 16,8,12,9,6,2,5 so that every aspects of the concept will be understood.

When my array elements are 9, 15,10 then how the sorting happens . please can any one of u explain . 🙏🙏🙏

❤❤❤❤

I think u made a mistake mam..the starting while loop is start>end..u have put start<end