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

[@swatiacharya9073]

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... .

[@JennyslecturesCSIT]

Happy to help

[@Anshchib_852]

Nyc

[@dineshkumar-m6n8q]

Me tooo 😢

[@bhanuprakashreddyponguru9904]

​@@JennyslecturesCSITwhat if the array is of even size then where should we place middle of element as pivot

[@gopipitta18]

Yeah it's me😅

[@HarmeetSingh-bk1lp]

thankyou so much mam, tomorrow is final paper of analysis and design of algorithm and your videos helped me so much. Thanks for teaching us.

[@Rakesh-uz6jq]

Presidency?

[@Sarkar.editsz]

Nice brother

[@sourav7556]

10 rupe dede

[@HarmeetSingh-bk1lp]

@@sourav7556 lol

[@sourav7556]

@@HarmeetSingh-bk1lp dede yaar

[@samhita2917]

Ma'am, who gave you this talent??? I came across thousand videos, but only you who talk with a great understanding of concept. I can see it it from your eyes. I can see it from every video you uploaded. I really appreciate what you are doing here.

[@Zoza0905]

Yeah she just nailed it 🔥

[@rickk3300]

True..✨✨

[@GoodBoy-eu9dw]

Medium of conveyance is also English still understanding is more comfortable than Hindi medium

[@infinity2creation551]

Hard work

[@51-subashkrishna6]

😂😂😂😂😂😂😂😂

[@ramaarahatekar]

omg why is it always 2 days before our exams that we realise our semester's topics were actually interesting!!! Thank you so much mam.

[@KenAdams-sn8yd]

exactly

[@vamshirallapalli5539]

well i find u intresting!

[@ramaarahatekar]

@@vamshirallapalli5539 study! 🤓

[@jassiedu1598]

so true 😅

[@Hariiissshhh]

@@vamshirallapalli5539 down bad bro 👎👎

[@hrishikeshpingle]

Thanks for the video ma'am. If anyone is getting out of bounds exception, just modify the first while condition as while(a[start]

[@rameshvarada3160]

Thanks Harishikesh Your comment must deserve min 1k likes...

[@rockygoyal3598]

No bro, you will still get the out of bound exception as you are using && operator, and one property of && operator is that, it stops the evaluation right where it gets the false condition. The condition should be while(start

[@hrishikeshpingle]

@@rockygoyal3598 thanks for the info bro, I didn't know that... But whatever I wrote, I tried it first with many cases... I was so frustrated with that error So maybe that is true for only some specific cases... My bad.

[@rockygoyal3598]

@@hrishikeshpingle Not a problem man, i'm glad that my comment helped in getting the scenarios right!

[@TheOne-cy3yu]

Still I'm getting Out of Bound Exc. Pls help😢

[@ayushpathak5205]

I was planning to skip this algo but thanks to you.. I don't have doubts anymore.. BEST video of this topic according to me...

[@yeyouhd8802]

i know i'm getting a 0 tommorow in my exam but this was worth watching, 25mn was better than a whole semester in my university

[@trainwithsantosh]

appreciated!

[@nirojbajracharya3051]

@@trainwithsantosh Dont spoil these brats.

[@hidayathali8003]

It is the matter of perception bro you have to change your state of mind and start learning and positive thinking

[@RAJEEVSINGH-vr6jq]

I can Feel u bro🥺😅 ... Viva Tomorrow 🙏🏻

[@yakshmahawer5434]

Which university bro??

[@charanmc4484]

Neso Academy and Jenny mam, no one's born to beat them in teaching programming so well😁😁💗

[@reroyallover9169]

sagar jat ka naam suna h bsddk

[@sooryanshsingh2957]

Le Abdul Bari sir: hold my calm and peaceful explanations. Bob ross of Algorithms !!

[@besmartdosmart8666]

Exactly 💯

[@LukeChippindall]

Thanks for a fantastic explanation. After watching a number of other tutorials I was still confused about some aspects of Quick Sort. Your approach and "old school" use of a whiteboard was perfect. I watched it with my 14 y/o daughter, and we both learned how the algorithm actually works, and we then spent time together coding it, enjoying the process of error debugging, and feeling of accomplishment when it worked as required.

[@aniketdey8449]

Some people are focusing on digital graphics for explanation, but the black-board teaching is the best way of teaching even in the future days also.

[@mdkhairummonir4847]

l mo kkk

[@techysanan8579]

White board *

[@suheelhilal1614]

Wah kya andhbhakt hai ...are bhai ye board ki wajah se nahi hai ye in ki skill aur easy language ki wajah se smj aata hai ...

[@adityamulik]

I wish I had these lectures back when I was in college in 16. All I did was mugged up the answers and cleared my paper. Now I realise the beauty of these algorithms and how efficiently they work in their own course of action.

[@MaheshMane981]

Aah.. Naa It's pretty Fun to be too.❤️ Thx for your comment

[@Tbm4545]

Now wht u r doing?

[@sauceontoes3457]

how do you even mug up the code? It's almost impossible to memorize each and every character in the code

[@southmoviesmelody]

You were in college in your 16's 😂

[@meha5623]

@@southmoviesmelody he means back in 2016 ofcourse 🙆🏻‍♀️

[@sairajdas6692]

Hands down the best explanation of quick sort on KZbin!

[@raulshahi8316]

So simply explained mam, i spent an hour trying to understand the algorithm from my note but couldnot.With your tutorial , it just became so much simple. Also I m watching all other sorts. Thank you very much mam Love and respect

[@heyram8951]

Would you please clear my one doubt. If ( lb< ub) then we will perform partition. Yes or no. If so the 7< 7 is not true then will we call partition or not then what to do.

[@lakshminarayanans1066]

@@heyram8951 ​And LB & UB are indexes, not values of the array. & such exception is not possible; either start will be greater than the end or vice-versa

[@heyram8951]

@@lakshminarayanans1066 okay. Thank you. 👍

[@Teja-j4p]

Waw awesome explanation mam ❤

[@HosRo4161]

You are an amazing teacher! Clear, step-by-step, easy-to-follow. Truly an excellent teacher! Thank you.

[@AbdulQadir-ni3ux]

Mam Thank you very much..... Assignment nhi Ban rahi thi lekin ap nay qasmaay Izzat baccha Lee ....... and the most important thing I actually come to understand different algorithm through your video........

[@somailaftab5896]

My friend suggests to me watch your videos lectures but when I watch this then i can easily understand your lecture your way of teaching is very great even that lower student can also easily understand it

[@meghnak2784]

maam..I am a new subscriber..Yesterday I came to watch your video to prepare for my today's lab exam ..Today I had got quicksort..and I had passed the exam with 100%output in first try itself..Thanks a lot maamm...

[@mandatimanoharreddy5133]

The spark in your eyes while teaching is too good which shows that how much dedicated you are towards the teaching

[@omkarnagarkar6660]

You are so good Seriously! The way you teach pointing out every detail and concern about the understanding capability of viewers is just exceptional. Keep up the good work.

[@nirmalakshourad8994]

Legends watching one day before exams😂

[@bubblecakke]

did you pass your exam?

[@Salmankhanstatus1]

Yes brother

[@rizwankakroo164]

Real legends

[@AkulaSriyan]

We are legends 😎😎😎😎

[@binnypero6431]

Half hour bro 😢

[@ravisharma3901]

so so simply explained mam, i think that in my final BCA exam i am failed in data structure then i see your video's now i think i am passed in data structure. thank you very much mam.

[@22vickymr9]

Great work !! Your lectures make it very simple to understand. While working with your code, I did some modification and added one more check in while loop. The checks are: while (a[start] pivot) and (end > lb): end = end - 1 This will handle the worst case scenario as well.

[@ayushacharya4778]

The intent is good, but this modification does not work as you need to check start pivot. Modification: while (start

[@PrakashKumar_ArmyOfTheSaviour]

@@ayushacharya4778 either way it works , it wont fail until something is messed in the quickSort logic.

[@AneeshChandra]

my DS sir: u r going to fail this sem me: missing all classes of DS in clg and watching these lectures before exams to get decent cgpa and to prove sir that he was wrong mam thank u so much .....definitely sharing and subscribing for such real life avengers who make such good videos for students like us. may god bless you mam the biggest irony is that we go to clg pay fees and dont understand even a single line but here everything is crystal clear wish me luck fellas please if u r reading this by giving a thumbs up

[@souravsahoo1582]

Story of whole Indian enginnering student 😂😂

[@AneeshChandra]

@@souravsahoo1582 true af🤘

[@surajkumarsingh8792]

Well my ds professor is searching to teach me but he don't know I m prepared 😏

[@myth_man1426]

Result kaa kya hua ?😅

[@AneeshChandra]

@@myth_man1426 7 mila btw mai mere chanel pe violin covers upload krta hu sun ke batana comment karke kasa laga kindly pls vai

[@thasnee56]

u r the real life example of "beauty and brains"... Your content is always helpful ❤❤

[@muskantiwari698]

I went through many videos to understand the concept of quick sort but no use, but this video is the one which actually helped me understand quick sort.....Great work Jenny! I can see your hard work in your videos.....God bless you beautiful soul! Keep up the good work❤️

[@kalyanachakravarthi2736]

Quick sort is a large and complex procedure, but you explained it in a simpler way, thank you mam

[@rafatulalam8677]

Brilliant explanation. I finally understood how the sorting algorithm actually works both theoretically and in code implementation !

[@AstrologerDeep]

at Last , what a smile .... i think this is smile of hard work , smile of patience of teaching , and at last , I smiled with my cleared concept. thank you

[@MohitKumar-bs9br]

Mam u r beauty with brain as well as excellent trainer. I can't understand aapse concept samjhe ya aapko dekhe . respect for you

[@butterchicken8559]

@Shrishti Raj no

[@RajKotecha-dc3yx]

Meri 25th april ko exam he esliye ab youtube pe search kia aur apka video dekha agar apka channel cource muje pehle hi mil chuka hota to muje bhut hi achhe se ho pata pr koi nhi der aye durust aye but i not only like but also love your method and personality!very Awsome..

[@karthikeyanikhil8873]

I am Chemical engineering student. But your lectures made me interest on c program 🙏🏻 I am really thankful for you

[@akanshasingh5500]

you're amazing omgg I hated sorting methods before but now everything has changed, it's all because of you, you're doing an amazing job, please don't stop!!! xxx

[@kaleshbiju6753]

Thanks a lot ma'am for explaining in such a simple way Theses sorting algorithms were big deal to me but now u made me it simple

[@AnkitSharma-nf6kc]

The simplest way, no need to mug up... Even I can teach this now... Sharing with my classmates...!! Quite a helpful ma'am kudos and blessings from our side.

[@abdulmohsin1]

Awesome Video. so helpful. easy to understand. just wanted to mention one thing. we woulld need to add one more condition in the line while(a[start]

[@hysem77]

You have the ability to make evrything simple no matter how hard it used to be. And... you have a cute smile ☺

[@shohaghossain2332]

Thanks Madam...I am totally satisfied when I Follow your lectures... Lot's of Respects and Love from Bangladesh 🇧🇩

[@vishalkarthik498]

i think choosing median element instead of first element will make quick sort efficient Your teaching is good ... Thanks a lot.....

[@sagaryadav8670]

Bhaiya mere median nikalne ke liye sort karna padta hai Kuchh pad liya karo khali time me Dimag se gareeb

[@jamalwebdevelopment4841]

It is good to take middle as pivot but by taking middle as pivot we can only get best case for sorted list but not for unsorted list. For unsorted still the worst case still be O(n^2).

[@techrelated4950]

Jo algorithm kisi or ki video me samajh nahi aata aap bhut achhe se samjha dete ho.. thankyou 😊

[@vikas_katla]

Thanks mam your lecture was wonderful Today I had my exam and I rocked it .and today I came to know my data structures teacher was a subscriber of your channel . Your channel was a boon for one night batting 🏏🏏🏏 tq mam Like if agreee

[@ravish5903]

Thanks a lot for explaining in detail. I just got to this video on KZbin Search for quicksort algorithm. While implementing this method. There was a basic mistake and I spent a couple of hours in understanding those mistakes. In the inner while loops in Partition function, we should also check for boundary conditions. while ($i < $end && a[start] $start && a[start] > $pivot) Keep uploading these wonderful videos which explain concepts very clearly... Regards, Ravish.

[@DeepakRaoGaikwad]

while (a[start]

[@HarishSumant]

Thanks, you saved my time!

[@farzanaashraf8136]

Assalam u Alaikum !can you please tell me about '"the last swapping and return R"what should be written before these statements.please must reply.

[@alexeynavalny4732]

please share a gist also...

[@farzanaashraf8136]

@@alexeynavalny4732 whom you are asking?

[@deepampaul4552]

Yup the code throws exception. Try below array {0, -22, 27, -35, 55, -77}

[@-CSE-saketjaiswal]

watching ur videos mam daily already watched bubble selection and insertion sort thank u mam . 1.simple explanation 2.deep conceptual clarity. 3.no doubts left. 4.godly teaching. 5.mam u r hacker . lots of love

[@getsomeknowledge3054]

U r the best programming teacher .your concept is so much clear and make me understandable.aap ke Karan hm smjh paye thank you ma'am .😘😘❤️ ❤️ Keep it up😊

[@guruprasath1877]

I'm not from a cs background but I was able to understand it well only in ya video. I have seen videos on my native language and other popular ones for 2 days. but this was the one that made me feel yes now I understand. - Thank you Jenny! Thank you for explaining it in such an order :))

[@021_ashutoshrai6]

Thanks it gives me a lots because i started learning C and Data structure and your videos helps me alot thanks😊

[@charanmc4484]

Mam thank you very much, I love the way you teach, its so understandable that even an average students understands very clearly. ab hogaya saara sorting techniques clear,love from Andhra Pradesh.

[@7291ashish]

Mam due to your lecture i m capable of giving the exam of DATA STRUCTURES THROUGH C++. THANKYOU so much.

[@RAHULPANDEY-ix3bf]

After watching your video i seriously fall in love ,the way you are teaching mam.a lot of thanks to you mam.and will pray to god that u always be healthy so that we can utilise you as much as possible.

[@durgabhavaniallu1510]

Mam u r giving a good explanation. We can understand and grasp the content very easily.thank u so much mam .we are so happy to have such a marvelous teacher

[@clins10]

Thank you so much MA. May God bless you. Algorithm explained in the simplest terms. Even my grandma can vividly explain this to another person after watching your videos.

[@gunarajesh1]

after 2 hours of search, I found your video which clears how quick sort to be implemented. thanks a lot

[@aafreens2073]

Same here

[@samitkhedekar5311]

It's been more than 5years till this is the best playlist for DS

[@DanishJamal898]

Mam.. Thanks for explaining this confusing topic in such a wonderful way🙂

[@Abhishek_Ram57]

"Thank you for your constant efforts in providing such valuable lectures. Your clear explanations and engaging teaching style have made it much easier for me to understand complex topics. We need more educators like you who are dedicated to making learning accessible and enjoyable. Keep up the great work!" Thank you Jenny...👏🏽❤️‍🔥

[@honghanhdo6690]

I've been following your Data Structures and Algorithms series while using reference books alongside, but all of your videos are very well-explained and easy to understand. Thank you so much teacher!!! Wish you the best.

[@bhavyabhagwani5407]

What reference books did she recommend? I am trying to find but didn't get where she said about any book😢

[@shubhamsharma5101]

Salute to your extraordinary teaching way. Thanks for making it easy for me.love from Jaipur

[@rajatkumar1894]

Thank you so much for these tutorials. These are really good for last moment revisions before going to exam. Thanks again :)

[@adityabhendavadekar4913]

Thank You so much ma'am for simplifying the beauty of quick sort algorithm. ❤️🙏🙏 Thanks a lot for this video.

[@muskanmuskan1874]

Mam apki ee video mujhe bahot use aayi tq so much mam I love you 😘

[@radhasethu6185]

I was very much confused initially but now i am quiet comfortable thanks a lot mam☺love and respect from chennai😍🔥

[@mohitchatterjee5517]

Thanks a lot, mam...I really switch to your channel from another channel to learn the sorting algorithm.....and yes it's really helpful to me.

[@yashwanthnerella9935]

best quick sort explanation i found today!

[@Srinivasssssss]

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..🔥🔥🔥

[@vivekbhardwaj9849]

Really beautiful... you and your way of teaching 😍

[@bishalchakrabortty2543]

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.....

[@dilipp007]

Beauty with brains.. Awesome tutorial

[@yashpanjabi8046]

ma'am you are a blessing for students or even working professionals who want to get better in DSA

[@durgaprasadankapalli3813]

Wow good explanation, I hope definitely I will crack interview

[@Its_meh_afrah]

Thank you soo much for this amazing explanation...all my life i was afraid of these dsa concepts because my college teacher considered that i cannot pass this subject...and that fear always stayed with me.

[@muhammadahsan-qn4xf]

wao what an explanation, thank you so much love from Pakistan.

[@Nithishkumar061]

I had arrear in my last sem , my friend are recommended your video i have cleared c program Thank you so much ❤❤🎉🎉

[@Nene_Anonymous]

The best explaination i've ever seen.

[@koneruprasanthi3854]

Excellent mam your teaching

[@kumarjena4040]

Thank you so much ma'am for your efforts🙌 Your way of explanation is really good and easy to understand. Thank you so much ma'am for making such videos and please keep them coming.

[@AbdiazizIbrahim-o3c]

Watching you from East Africa (Kenya) appreciate your lecture mum

[@payalsagar1808]

how beautifully and simply explained ...u just nailed it mam😘😘😘😘thankyou mam...

[@abhishekkumargupta3043]

Well, giving the equal symbol in a[start]

[@sakshimathur8526]

thankyou so much Abhishek Gupta. I was stucked this outOfBound error for 1 hour. You solved my problem. Thanks a ton

[@abhishekkumargupta3043]

@@sakshimathur8526 Alrighty!

[@alkaupadhyay3944]

i am confused whether i like watching you or your video but let me tell you both are amazing...

[@ankittyagi8060]

Great Explanation Mam, Thank You! I hope i will remember it for long Do you see that first inner loop will give IndexOutofBound for given example, when pivot=15, index is 7, we do start++, next it will check for 8th element which is 7 again it will go inside and start++, now start is 9 and A[start] does not exists in while condition. I think in while, we should also check if start

[@Nithishkumar061]

I had arrear in my last sem ,my friend are recommended your video i have cleared in my first attempt thank you so much ❤🎉🎉

[@djuroradusinovic5475]

I think we might get index out of bounds exception if the array to be sorted is sorted in reverse order when passed to this function. It would help if your if statement is while ( start

[@kurapatiabhilash2911]

bro not jenny mam, your comment saved me

[@ayushacharya4778]

Exactly. But I think end>=lb is unnecessary check as a[start]

[@shreevatsahungund9569]

Am from reva University Bangalore. Tomarrow is my data structure exam and am 100% ready seeing your videos. Tqsm mam 💗.... I wish my prof. Could have taught like you .....

[@MohsinAli-nw1hh]

Thanks Mam. I have got complete concepts of sorting algorithms after watching all the video series. Thanks again :)

[@JennyslecturesCSIT]

Welcome :)

[@SamimHossain-hi9fn]

Love you very much mam for your teaching techniques.

[@pallavimeshram5491]

I am getting distracted... half of the time while seeing your videos i wonder how beautiful and intelligent a person can be... Thank You so much for your efforts

[@ashok0o7]

yes so true

[@cricket_contents]

Tumara y haal h.. To...

[@abhivishwakarma2758]

Mam itni sundar hai ki Hamara maan dag maga jata hai

[@kMuhammadRayanAli]

kia pagal log ho yaar kasam se

[@rakeshraj1866]

World 🌎 best youtuber for DSA

[@ashutoshpatel007]

Thank you mam... finally I got this sort concept clearly. Thanks Mam... love and respect from Ahmedabad 😍😍😍😍🤗😊

[@avipsaswain1162]

Thanks alot mam😊

[@shubhammasali5175]

Thank you so much 🙏 When my man taught me I didn't understand anything 🤣 and tomorrow was my test. I was in tension But when I saw your video i understood everything. Thank you once again 🙏🙏

[@RunningBlade_]

I'm never going to forget this algorithm. Thank you mam 🙏🙏

[@vinayak186f3]

Yaad hai abhi tak ?

[@abhinavsharma4673]

😂😂

[@Gamersgalaxy148]

BEAUTY WITH BRAINS .....this can be said to very few rare people and thats u mam

[@abhaykumarsingh2838]

while(a[start]

[@subhajitghosh3651]

here i write this code in java but it is showing ArrayIndexOutofBound exception i replace while ( arr[start]

[@dileshsolanki2383]

@@subhajitghosh3651 start < a.length && a[start]

[@dedarulislam4124]

Absolutely right bro. Must set boundary cases to avoid error. Thank you

[@amanmishra-vt8hk]

Bhai tumne a.length C me kese use kar liya

[@sergcool]

not a.length-1, but ub, because the ub will change with recursive calls, for example on left half, left of pivot. you will work from 0 to pivot -1. Not 0 to a.length-1. a.length-1 is good just for the first initial call. Remember we are cutting the problem into smaller subproblems. We don't wanna traverse the whole array with each recursive call.

[@zheyeetan4048]

when i was finding resources on internet, i come to this page first, and see if here got any sources i need. It does! tq

[@rajat1548]

Amazing and the most simple explanation of the complicated sorting algorithm. Thank you so much maam

[@Emperor723]

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 💕

[@fakhriddinumarov9784]

Your programming and pedagogic skills are fantastic! Thank you

[@sreyakukutapu]

Thank you for Amazing lectures...you are making learning DSA easy

[@amitsinghkatiyar5779]

Nicely explained, will be good to add that we should also check that "start" < array length and "end" should be >=0

[@curtismills]

(start < end) already checks for that because we know that (end < array lenght) and (start >= 0)

[@dhanam79]

@@curtismills try to do the same algorithm with an array like 8 7 6 5 4 3 2 1 as its elements. That is what Amit is telling. You will end up in a null pointer exception.

[@ashishkalra9438]

Correct....but no need of end condition modification..Also don't go for array.length.....Check for upperBound only. So just one && condition needs to be added to handle the worst case of all elements given in descending order. while(arr[start]

[@pooja.sahu95]

u r right...we need to add these conditions

[@twi4458]

@@dhanam79 Thanks for giving example

[@debashissahoo1995]

Thanks for your explanation... i was getting index out of range exception then i have modified this code and it worked while(start pivot) end -= 1

[@ayseak_]

I was stuck in that moment also, your comment helped, thanks!

[@shaikatif7226]

Beauty with brain “dangerous combination” I am in love already

[@edustouchpoint8968]

Same to brother

[@chamnil8666]

You are a wonder woman,your teaching is amazing.I watch your videoes every day.Thank you so much for doing these educational videoes.