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

Подписаться 1,7 млн

Просмотров 2,7 млн

50% 1

In this video, we will learn about the Quick Sort Algorithm.
Step by step instructions showing how Quick Sort works
DSA Full Course: https: • Data Structures and Al...
******************************************
See Complete Playlists:
C Programming Course: • Programming in C
C++ Programming: • C++ Complete Course
Python Full Course: • Python - Basic to Advance
Printing Pattern in C: • Printing Pattern Progr...
DAA Course: • Design and Analysis of...
Placement Series: • Placements Series
Dynamic Programming: • Dynamic Programming
Operating Systems: // • Operating Systems
DBMS: • DBMS (Database Managem...
******************************************
Connect & Contact Me:
Facebook: / jennys-lectures-csit-n...
Quora: www.quora.com/...
Instagram: / jayantikhatrilamba
#quicksort #sortingalgorithm #datastructures

Опубликовано:

7 сен 2024

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист

Посмотреть позже

Комментарии : 1,7 тыс.

@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 10 месяцев назад

Nyc

@dineshkumar-m6n8q 7 месяцев назад

Me tooo 😢

@bhanuprakashreddyponguru9904 7 месяцев назад

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

@gopipitta18 5 месяцев назад

Yeah it's me😅

@yeyouhd8802 3 года назад

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 3 года назад

appreciated!

@nirojbajracharya3051 3 года назад

@@trainwithsantosh Dont spoil these brats.

@hidayathali8003 3 года назад

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

@RAJEEVSINGH-vr6jq 3 года назад

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

@yakshmahawer5434 3 года назад

Which university bro??

@ramaarahatekar1570 Год назад

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 3 месяца назад

exactly

@vamshirallapalli5539 2 месяца назад

well i find u intresting!

@ramaarahatekar1570 2 месяца назад

@@vamshirallapalli5539 study! 🤓

@jassiedu1598 Месяц назад

so true 😅

@Hariiissshhh Месяц назад

@@vamshirallapalli5539 down bad bro 👎👎

@aniketdey8449 3 года назад

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 3 года назад

l mo kkk

@techysanan8579 2 года назад

White board *

@suheelhilal1614 2 года назад

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

@samhita2917 3 года назад

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 2 года назад

Yeah she just nailed it 🔥

@rickk3300 2 года назад

True..✨✨

@GoodBoy-eu9dw Год назад

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

@infinity2creation551 Год назад

Hard work

@charanmc4484 3 года назад

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 6 месяцев назад

Exactly 💯

@adityamulik 3 года назад

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 2 года назад

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 🙆🏻‍♀️

@LukeChippindall 3 года назад

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.

@AneeshChandra 4 года назад

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 4 года назад

Story of whole Indian enginnering student 😂😂

@AneeshChandra 4 года назад

@@souravsahoo1582 true af🤘

@surajkumarsingh8792 4 года назад

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

@myth_man1426 4 года назад

Result kaa kya hua ?😅

@AneeshChandra 4 года назад

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

@nirmalakshourad8994 Год назад

Legends watching one day before exams😂

@bubblecakke Год назад

did you pass your exam?

@Salmankhanstatus1 5 месяцев назад

Yes brother

@rizwankakroo164 5 месяцев назад

Real legends

@AkulaSriyan 5 месяцев назад

We are legends 😎😎😎😎

@binnypero6431 5 месяцев назад

Half hour bro 😢

@raulshahi8316 5 лет назад

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 2 года назад

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 2 года назад

@@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 2 года назад

@@lakshminarayanans1066 okay. Thank you. 👍

@user-ub4ey5ky8r 2 месяца назад

Waw awesome explanation mam ❤

@hrishikeshpingle 3 года назад

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 2 года назад

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

@rockygoyal3598 2 года назад

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 2 года назад

@@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 2 года назад

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

@sairajdas6692 5 лет назад

Hands down the best explanation of quick sort on RU-vid!

@ayushpathak5205 7 месяцев назад

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

@HarmeetSingh-bk1lp 2 года назад

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 2 года назад

Presidency?

@Sarkar.editsz 2 года назад

Nice brother

@sourav7556 Год назад

10 rupe dede

@HarmeetSingh-bk1lp Год назад

@@sourav7556 lol

@sourav7556 Год назад

@@HarmeetSingh-bk1lp dede yaar

@kalyanachakravarthi2736 3 года назад

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

@AbdulQadir-ni3ux 4 года назад

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

@22vickymr9 4 года назад

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 3 месяца назад

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

@PrakashKumar-yj2gc 9 дней назад

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

@omkarnagarkar6660 4 года назад

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.

@mandatimanoharreddy5133 Год назад

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

@meghnak2784 4 года назад

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

@rafatulalam8677 3 года назад

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

@ravisharma3901 4 года назад

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.

@karthikeyanikhil8873 3 года назад

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

@vishalkarthik498 4 года назад

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

@sagaryadav8670 4 года назад

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

@jamalwebdevelopment4841 4 года назад

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

@kaleshbiju6753 3 года назад

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

@muskantiwari698 4 года назад

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❤️

@somailaftab5896 4 года назад

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

@MohitKumar-bs9br 4 года назад

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 3 года назад

@Shrishti Raj no

@HosRo4161 5 месяцев назад

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

@AnkitSharma-nf6kc 4 года назад

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.

@vikaskatla3336 3 года назад

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

@getsomeknowledge3054 5 лет назад

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😊

@mohdtarik4803 2 года назад

Literally mam No one explain this algorithm such a way that you do 💯💯💯☺️😊💕💕 From Kanpur Next day my exam of DSA MCA 2nd semester 💯💯💯

@akanshasingh5500 5 лет назад

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

@7291ashish 5 лет назад

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

@hysem77 3 года назад

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

@021_ashutoshrai6 5 лет назад

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

@adityabhendavadekar4913 2 года назад

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

@DeepakRaoGaikwad 4 года назад

while (a[start]

@HarishSumant 2 года назад

Thanks, you saved my time!

@farzanaashraf8136 2 года назад

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 2 года назад

please share a gist also...

@farzanaashraf8136 2 года назад

@@alexeynavalny4732 whom you are asking?

@deepampaul4552 2 года назад

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

@-CSE-saketjaiswal 3 года назад

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

@honghanhdo6690 4 года назад

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😢

@pallavimeshram5491 4 года назад

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 3 года назад

yes so true

@cricket_contents 3 года назад

Tumara y haal h.. To...

@abhivishwakarma2758 3 года назад

Mam itni sundar hai ki Hamara maan dag maga jata hai

@kMuhammadRayanAli 3 года назад

kia pagal log ho yaar kasam se

@DanishJamal898 5 лет назад

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

@horcrux8329 4 года назад

Ma'am was teaching and looking at the camera and i was looking at her and smiling because how adorable she felt. i would 100/100 attend all lectures , day, night whenever , if she taught us. But , apart from all that , im really greatful ma'am helps us academically by making these videos. Keep on going ma'am.

@radhasethu6185 4 года назад

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

@djuroradusinovic5475 4 года назад

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 3 месяца назад

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

@rajatkumar1894 4 года назад

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

@kumarjena4040 3 года назад

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.

@gunarajesh1 5 лет назад

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

@aafreens2073 4 года назад

Same here

@shohaghossain2332 3 года назад

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

@aryansingh2105 3 года назад

In the partition method. Line No. 6. There is a small change. while(a[start]

@sushantpoman 2 года назад

Really good

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

@abhishekkumargupta3043 4 года назад

Well, giving the equal symbol in a[start]

@sakshimathur8526 3 года назад

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

@abhishekkumargupta3043 3 года назад

@@sakshimathur8526 Alrighty!

@durgabhavaniallu1510 2 года назад

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

@durgaprasadankapalli3813 5 лет назад

Wow good explanation, I hope definitely I will crack interview

@Srinivasssssss 11 месяцев назад

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

@shubhamsharma5101 4 года назад

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

@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

@ankittyagi8060 2 года назад

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

@Abhishek_Ram57 2 месяца назад

"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...👏🏽❤️‍🔥

@rajat1548 4 года назад

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

@ravish5903 2 года назад

Thanks a lot for explaining in detail. I just got to this video on RU-vid 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.

@yashwanthnerella9935 5 лет назад

best quick sort explanation i found today!

@charanmc4484 3 года назад

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.

@vivekbhardwaj9849 4 года назад

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

@techrelated4950 3 года назад

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

@Nene_Anonymous 4 года назад

The best explaination i've ever seen.

@koneruprasanthi3854 4 года назад

Excellent mam your teaching

@Nithishkumar061 Месяц назад

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

@RunningBlade_ 4 года назад

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

@vinayak186f3 3 года назад

Yaad hai abhi tak ?

@abhinavsharma4673 3 года назад

😂😂

@RAHULPANDEY-ix3bf 3 года назад

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.

@amitsinghkatiyar5779 4 года назад

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

@curtismills 3 года назад

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

@dhanam79 3 года назад

@@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 3 года назад

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 3 года назад

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

@twi4458 2 года назад

@@dhanam79 Thanks for giving example

@clins10 2 года назад

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.

@PythonisLove 5 лет назад

I am quiet good in Data structure part ... as far as I think , but I repeatedly watch your videos , donno why !!! 😜😜

@aadisupersonic 5 лет назад

Tharak mitr tharak 🙂

@navneetprakash6874 4 года назад

Haha

@srsurya1037 4 года назад

Padai pe dyan rakhna beta

@sukhdevsharma5611 4 года назад

Ladki ka chakkar babu bhaiya

@omprakashmeena7746 4 года назад

Very Good explanation... Thank you Ma'am

@abdulmohsin1 2 года назад

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]

@MohsinAli-nw1hh 4 года назад

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

@JennyslecturesCSIT 4 года назад

Welcome :)

@teetanrobotics5363 4 года назад

Ma'am I love the way you explain hard concepts in an easy way. The presentation is clear ,concise and to the point. Ma'am could you please upload a playlist on C++ STL(Standard Template Library) since there aren't good videos covering that topic on RU-vid ?

@anjneykumarsingh4461 4 года назад

Saurabh shukla sir has uploaded

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

@dilipp007 5 лет назад

Beauty with brains.. Awesome tutorial

@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 🙏🙏

@muhammadahsan-qn4xf 4 года назад

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

@shreevatsahungund9569 2 года назад

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

@fakhriddinumarov9784 3 года назад

Your programming and pedagogic skills are fantastic! Thank you

@alkaupadhyay3944 3 года назад

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

@ashutoshpatel007 4 года назад

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

@avipsaswain1162 3 года назад

Thanks alot mam😊

@yashpanjabi8046 4 месяца назад

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

@abhaykumarsingh2838 4 года назад

while(a[start]

@subhajitghosh3651 4 года назад

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

@dileshsolanki2383 4 года назад

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

@dedarulislam4124 4 года назад

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

@amanmishra-vt8hk 4 года назад

Bhai tumne a.length C me kese use kar liya

@sergcool 4 года назад

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.

@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 ❤🎉

@payalsagar1808 5 лет назад

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

@igxniisan6996 6 месяцев назад

so that means British colonized India using the Quick Sort Policy

@gurupreetsingh8347 4 года назад

Hi , dear Jenny, big thanks for yours lovely and great effort. Have one request to u , if it's possible pl make seperate vidoes on how to calculate time & space complexity for both interative and recursive approach and put them in separate playlist .. because after understanding the ds and algo mostly people ( including me 😁 ) don't know how to calculate time and space complexity of any algo ... Really. Thankful to u in advance...

@DeepakKumar-fx5su 4 года назад

Right bro. We need separate video for time complexity

@muhammadmudassar3932 5 лет назад

really impressed from your way of teaching respect from pakistan 💕

@JennyslecturesCSIT 5 лет назад

Respect from india too

@harshadgandhale5372 4 года назад

Pakistan mey it companies hey kya😀😂😂😂🤣

@nagesh5374 4 года назад

I am really in love with this woman... Not in that way... In a way that she is teaching :)

@bishalchakrabortty2543 11 месяцев назад

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

@shaikatif7226 3 года назад

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

@edustouchpoint8968 3 года назад

Same to brother

@FarmanOfficial777 2 года назад

Literally people are charging thousand of rupees to teach DSA but here every important concent is free hats off ❤️

@R0leexx 2 месяца назад

Me 2 hr before the exam 😅😊

@azizuddinshaikh9609 Год назад

Thanks a lot for this algorithm mam i just can't express my joy after getting this concept clear, coz it looks very hard when i learn it by my college teacher,it was just out of coverage for me. Thanx a lotttt MAM 🙏🏻🤲🏻😇