2.8.1 QuickSort Algorithm

[@MrRobot-gm9cv]

Abdul Bari, you're honestly such a talented teacher. Please don't stop making these type of videos. You are an angel sent from god.

[@DonBeleren]

I toooooootally agree!! He rocks!

[@parthvasoya3562]

Awesome man, just awesome

[@kusumaseera3753]

Yes

[@mittalji919]

this man has saved us from getting fail in ds and algo😂😂

[@madhumithak3338]

yes....He passed me in the exam....Very Thank you sir

[@anthonyisensee]

When he quietly said "that's it" I couldn't help but laugh. Because that's the most popular sorting algorithm in computer science, excellently explained in 13 minutes. That is indeed it, my fine sir. Thank you.

[@repvoo2399]

What is there to laugh about it?

[@Chaos_Nova]

@@repvoo2399 bitter…

[@sandro-of9fq]

​@@repvoo2399 laugh of joy.

[@dhanush9570]

@@repvoo2399 bruh🙄

[@SanilJadhav711]

@@repvoo2399 He literally mentioned in the comment itself why he laughed 🗿 your question comes off real negative ngl

[@shubhamn2690]

Your timing of taking pauses while teaching is just sooo right! It allows the viewer to process the information right at the time when it's needed.

[@seanpayne9124]

I don't know if you still read these comments, but this explanation was so clear and concise. I really appreciate it.

[@a-cah1423]

He dropped a hint.

[@Lunixed]

I pay more than one thousand dollars to my algorithm analysis Professor here in the United States and I don't understand a single word that man says but you, for FREE have guided me through the whole entire course... I wish I could pay you instead. Thank you so much for the lectures.

[@NeverQuitOk]

Teaching is a skill which is gifted by God. Now a days so called teachers are spoiling education system. The talented professional teacher are rarely found in college. Only business they want, not quality

[@modelingandsimulation6941]

Feel the same

[@fatehmammadli7336]

He has patreon

[@abkyabacha]

Yes, I bought his Udemy course of DS and Algos even though I didn't need it.

[@sid_sipani]

@@srujohn652 Arey bhai kuch toh sharam kar le xD

[@thexxmaster]

Indian youtubers are the backbone of the new KNOWLEDGE ECONOMY

[@danialhaziq7761]

FACTS!!!

[@teratoma.]

word

[@anubhavsingh9049]

No

[@putinscat1208]

This teacher is very clear, and shows all the steps. And, he doesn't get into his religious, political, or personal stuff, he doesn't get distracted by pets coming into the video, etc. Unlike you.

[@Sanyu-Tumusiime]

@Tharun tharun My country doesn't even have a education here in Africa. This is legit premium super first class for free here on youtube i'm so glas that people like him exist

[@vibhutisahu5376]

7:07 when you take pause, I am getting how deeply you have dive into each and every topic with details.... this type of control only comes up with the lots of patience, dedication and passion towards the thing what you love to do as a teacher...Huge respect for you Abdul Sir... It's my pleasure to study DAA from you in a such smoother way

[@livingbeing8661]

This person is legendary. Explaining quick sort in just 13 minutes is not a joke yet explain it so easily. Huge respect for you Sir.

[@turtlepedia5149]

Sir not only in INDIA but you are helping students all over the world 🔥🔥respect ++

[@NirmalSilwal]

watching from Nepal

[@RAMAMUHAMMADMURSHAL]

Wathcing from Indonesia

[@okaybossiamonyoutubeakkskd]

@@dipankar9700 nice one dipankar

[@LocNguyen-mn4dd]

watching from VietNam

[@jethrocenas3120]

++respect

[@alperozdamar517]

You are the best teacher in algortihm, I've ever seen. Albert Einstein has a saying "If you can't explain it simply, you don't understand it well enough." Since I saw this video, I was so confused. Actually, I realize that it is very easy. You made my mind flashed. Thank you Abdul.

[@shivalkondwar]

Your teaching style is really Amazing. Keep it up Sir Ji!

[@GSEDITZAMV]

Great 👍

[@MegaGemoroy]

Thank you Mr Bari, not only you are very knowledgeable in this field but you are also able to communicate it in an easy to understand way. A great educator. You are a legend in our faculty, everybody knows you and respects your work.

[@abdul_bari]

So nice of you

[@kimjiyoung8655]

Hi Abdul. Im Korean who is learning computer science here in Denmark. I have actually watched more than 30 different quick sort tutorials, and can definitely say your the best. it helps A Lot, thank you so much. 😘😘😘

[@abhirajarora7631]

Korean in Denmark and leaning topics on KZbin with the help of an Indian teacher. Truly a globalized world!

[@techtronics6121]

You should give respect to Sir. Is he your same age or junior that u talk to him like, hi Abdul?

[@kimjiyoung8655]

@@techtronics6121 🤣sorry I'm living in Denmark, and we are 'Allowed' to call each others name and of course say "hi" regardless of their age, gender, race or their job. I can see you are SICK.😂 poor thing

[@KnowledgeIsGold]

@@techtronics6121 fk your mom

[@movocode]

@@techtronics6121 In foreign countries it's quite normal - people even call ceo's by their first name.

[@CellerCity]

Thanks man! Your parition method was quite easy to understand and intuitive. Here is another way of partitoning that was taught by my professor ( I still remember it) Partition(l, h){ pivot = A[h]; i = l - 1; for( j = l to h-1){ if(A[j]

[@echoesofelysium18]

Hi, the topic is Quick Sort. And thank you for watching the video. No asking for likes and subscribers and showing the bell icon thingy in the middle of the video. Perfect teacher. Not even expecting personal benefits. Hats off to you sir.

[@bilalshafqat1634]

Fantastic, what a way to explain. I have no words. I passed my Data Structure course and my degree with A grade but I was never able to understand quick sort from the slides. Today I went through this video and damn. Excellent job.

[@kartashuvit4971]

Great explanation. FYI if anyone is struggling implementing this even after following his pseudocode, it's because you need to add an extra check in the do-while loops. You need to first check if i < length(A) before checking A[i] -1 first. Otherwise your extreme left/right partitions can run out of bounds.

[@ashutoshchoudhari9630]

if i < high and j > low. This should be the condition

[@Sedri14]

@@ashutoshchoudhari9630 Thanks, that's exactly what I needed

[@calebhoward4718]

I have never been more grateful, I have used a couple of your videos to better grasp the concepts and always came out with it sticking. Thank you for these videos, they have helped me significantly!

[@sumedhdeshpande3420]

Please add this to the description. 0:00 Idea behind Quicksort 03:03 Quicksort Definition 04:00 Procedure of Quicksort/Working of Quicksort 09:15 pseudo-code for Quicksort/Logical implementation of quicksort

[@aakashdahal8207]

Sir, I am from Nepal and my DAA exam was yesterday.Watching your videos were of great help.You really are a good teacher..My all friends study watching ur video...Sukriya

[@taskunter_dev]

I watched quite a few online tutorials and spent so much time at the uni's classes, but I have never met such a talented teacher as you are! Thank you! :)

[@dinuka]

came here after reading so many articles about quicksort and without understanding anything. got the idea in a few minutes after watching your explanation. best video to learn quicksort.

[@fitnesstravelwithdm4541]

Happy teacher's day sir 😊..Hope you remember , you came to our college (Ideal institute of Engineering , Kalyani)..I was in the first bench attending your lecture..By your free you tube lectures on algorithm , many students are benefited.. without doubt Design and Analysis of Algorithms is tough subject to understand , but you made it easy to understand..On the behalf of the students , thanks​ a lot sir 😊.

[@raviramasath2421]

Please tamil teaching

[@adriandsouza5735]

I passed my master's degree with distinction after learning concepts from these videos. Thanks a lot sir ....

[@LiquidMasti]

my professor took 2h to teach quick sort and still don't understand quick sort than i came here only 13min of video clear my concept. thanks andul sir big fan

[@vishwam7928]

Within 3 min you gave almost 90% idea and understanding of the algorithm, fantastic.

[@fatimanasir1502]

This was like eating up the whole algorithm in 13 minutes, thank you so much for making it seem almost effortless.

[@taaihone6881]

After watching 5 videos on Quicksort, this is the one that actually clicked for me. Big thanks!

[@manojprabhakaranm5752]

That look you give after each explanation 😂 that gives me satisfaction 😁 U R great sir

[@masoom5320]

😂😂😂😂😂😂😂😂

[@vaishnaviverma6152]

Before watching this video, I had a fear from quick sort. But before completing this video, see the magic, fear has already gone. Before this I had watched many videos for understanding this topic but this one is just awesome. It was uploaded 6 yrs ago but still comes under one of the best videos for this topic.

[@adrian716]

Thank you, sir. When I don't understand something at the university, I know you're here to save me. Great explanation!

[@zainabsyeda5644]

Absolutely saving my life 4 hours before my final exam. Thank you.

[@eltaahiras-salafi7958]

Meanwhile my professor reads off powerpoint like a robot and doesn't explain anything.

[@s.m.saifulislambadhon2654]

His calmness is making everything easier and easier

[@praveersharan3775]

this is awesome. seriously. this guy knows how to teach.

[@Saurabh5989]

I have seen videos and articles of many renowned people with no luck but then finally I landed your channel to get one stop concrete explanation to all complex algorithms. Thanks a lot sir. I was understanding the approach behind but was unable to appreciate the concept behind these.

[@maliktarannum5418]

I watched so many videos got irritated but didn't understand it....finally your video has cleared this concept thank u so very much ...very nice 🖒

[@ayushisingh5034]

Best video ever. I was so happy watching your videos it feels like I have found the gem. Finally able to understand the topic otherwise I was ready to memorize the code. But now no need to learn it finally understood. Thank you so much sir. THANKS A LOT!!

[@nikunjmishra5817]

Mark my words today....no one can explain quick sort better & in such a small, crisp & to the point manner.....sir you have made these algorithms such a cakewalk....you are just a gem for college students....

[@LizyAd]

This was the best explanation of all the videos I looked at for Quick Sort. Please don't ever stop teaching. I am watching from Chicago! Thank you!.

[@pranavi4324]

Prompt and excellent explanation. One of the best teachers on KZbin

[@mohamedatef3526]

The way Abdul Bari receives and processes concepts in computer science is what makes his explanation for them that good. We are dealing with a phenomenal person who is hard-working, descent, and talented. Thank you sir.

[@parameshwarannatarajan3785]

This is God level explanation. I could write this code in one iteration. You are making computer science knowledge accessible to all.Thank you sir , looking forward to more such content 🙏

[@maqeelkhader]

The need for infinity can be better explained by noticing that the first while loop will never end in case the input is sorted in descending order {5,4,3,2,1} . Infinity is a trick to prevent that situation here.

[@prathamkushwah1670]

I dont know which test case you are using but this algo works fine without using INFINITY in the last position. It worked for [5 4 3 2 1], the test case you mentioned (without infinity).

[@anitsarker4591]

@@prathamkushwah1670no it doesn’t work because i will continue incrementing until gets index out of if bound exception, because the first is the max element in the array, and no other element is bigger than it on the right hand side.

[@asmo_1929]

@@anitsarker4591 If it reaches infinity it will give an out of bounds exception anyway because position h is outside the array, I added a condition sa that it doesn't reach past h

[@vanchark]

you can alternatively check if i ever crosses j (i.e., while i

[@metulusoy]

This discussion should be higher. I also spent time to understand if infinity is necessary and based on this example, I will try it myself.

[@hellosanrioocore]

you explained the algorithm soo effortlessly omgg .....im crying i have never got soo crystal clear explanation in my life

[@Shambo271]

You, Sir, were put on this earth to help us all get better! Your teaching style is exceptional. Thank you.

[@boombasach]

I wish I had a time machine to take you back in classroom 25 yrs back. Keep doing, you're an inspiration

[@lasithathilakarathne3205]

"Hi, The topic is Quick Sort". You got me there. My first impression was, you're the most straightforward man I have ever seen in my life.I didn't even want to increase the playback speed. Enjoyed every second of the video and yet, I learned what was taught in a 2-hour confusing lecture, within 14 minutes. Thank you very much sir! and you got yourself a new subscriber.

[@Ironslayer423]

"Hi, the topic is quick sort..." No promotion, No BS! You're a gem to this generation of engineers sir, we owe you a lot. Thank you.

[@marianoduca9839]

Amazing, took me 10 minutes to grasp this thing better than 1 year of university ! God bless you

[@rishabhsahu5257]

So true !!! ..Same here

[@karanveersingh5535]

Whole 1 year they taught quicksort only 😂

[@palakbhardwaj6359]

bhai tujhe issai pyaar hai

[@dineshshekhawat2021]

This is the best explanation for quick sort I have ever seen. Crystal clear and understood in one watch.

[@RahulKesharwanialwaysyours]

I have watched many videos on Quick Sort Tutorials but this is the video which I was finding. Thank you so much for uploading an effective tutorial.

[@mansoortmans]

Rahul Kesharwani same to me

[@tejabhaiyt4244]

00:04 Quicksort is a sorting algorithm where students arrange themselves in sorted order based on their height 01:21 The main idea of QuickSort is to arrange elements by comparing and arranging themselves based on their height or length. 02:51 Quicksort is a divide and conquer algorithm that sorts elements based on their position in a sorted list. 04:22 QuickSort algorithm explanation and initial setup 05:59 Partitioning procedure for QuickSort algorithm 07:59 The QuickSort algorithm involves partitioning the list based on a pivot element and recursively sorting the sublists. 09:43 The QuickSort algorithm involves partitioning the array based on a pivot element and recursively sorting the subarrays. 11:57 Quicksort is a partitioning algorithm used to sort a list.

[@Amir-wp8el]

I don't know if you still read these comments, but this explanation was so clear and good , thank you

[@mislam2565]

I couldn't understand the internal working of QuickSort algorithm, unless I watched this. Great work! You have broken down the technique so well. Thanks a ton! and keep up the good work.

[@jabbahiggs7039]

This is much easier to follow than other videos about quicksort. Thanks!

[@pvtbx4198]

This guy has such a comforting vibe for some reason... seems so nice

[@asimchakraborty2930]

I'm from Bangladesh.. But to know such things Abdul Bari sir is our first choice.. because when he says "That's it".. it means it's really done..

[@shahi_nawab]

He taught with such calmness and pace, felt like i quenched every line of code, such a Great teacher 👌🔥

[@piratedvirus]

After all those months, I finally understand this algo perfectly! Thank You

[@fashizlecartman]

Sir. you are by far the most clear explainer of any computer science topic. hats off to you.

[@alekosthecrow]

I love how you sometimes sound like you've already tried to explain it to me like 10 times and I still don't understand

[@abduljelilali568]

the greatest computer science teacher on the web, hats off to you sir!!!!!!!!!!!!!!!!!!!!!!!!!!!!

[@profrenatoifspgru4928]

Greetings from Brasil. Thank you for the video, this subject is dificult but when you teach it seems very easy. Unfortunately, I learn more from your videos than in classroom where I'm having classes of analysis of algorithms in master degree.

[@aishashaik9247]

Sir it took me 3 months to understand this sorting technique.... But now that I found this video! I clearly understood every pin to pin detail of how it works... Thank you so much for making it so easy sir🎉

[@haliluluoglu1188]

You're one of the best teacher i have seen.Thank you very much,regards from Turkey.

[@linuxguru27]

iyi usta bulusak egitim cok kolay oleyor

[@SpeedKillersGaming]

Abdul Bari universitedeki bir derste cok yardimci oldu helal olsun ona. Derselerimize gitmedik ama youtubla orendik 😂

[@ShaakirKarim]

Understood this concept in 15 mins what professors couldn't teach in 1 lecture , we love you sir you have literally proven that teaching is an art .

[@himanshukoul8615]

Thanks for uploading this.. just sorted my life

[@zAbdullahKhan]

I am confused at one point that is i is not less than j and sir is still interchaning i and j values i.e, in first swap i=16 and j=5 so i is not less than j. while in the code it is if(i

[@kunalgupta8380]

@@zAbdullahKhan i and j are index not value

[@mikelosmikes7360]

LEGEND! You explained the basic idea about quicksort, which is that we want, is to find the final position (index) of the pivot element, in final sorted array.

[@jrmaverick181]

WONDERFULWONDERFUL.EXCELLENT,EXCELLENT BIG DADDY KEEP IT UP ,YOU ARE FAR FAR BETTER THAN SOME CHIMPANZIES MAKING QUICK IMPRESSION IN THIS FIELD.....

[@EC_Ritesh]

sir you made it look so simple ! ... i can say its the simplest explanation i have surfed for in youtube for quick sort. THANKSS

[@faycalsaid702]

Even the teacher didn't succeed to explain to me, thank's a lot now I'm up!

[@marcosrj21]

Abdul looks like the kind of teacher that is so dedicated that makes you want to learn so you can show your gratitude for his dedication.

[@shobhitranjan8680]

you are creator of many youtubers , who are taking thousands from us to teach same thing. eg-> Love babbar, TUF, Apna College and many more

[@saravanasai2391]

😢 Abdul Bari. That's a clear explanation. I am trying to under that speration part for 4 hours. You nailed it in 13 min

[@kingofgods898]

The only man on planet Earth that makes learning CS concepts actually enjoyable

[@palakbhardwaj6359]

u ain't one

[@amitbehera8454]

A small change in do-while loop do{ i++; }while(i < h && A[i] l && A[j] > pivot);

[@_sarthakmisal]

Congratulations for 1M Abdul sir

[@whatisnew1511]

thousands of tutorials in just one video. keep it up you're are an amazing teacher

[@sneha.tiwari]

_From last month till now I was damn confused with quicksort_ _and here you explained everything in just 5 minutes_ _thank you so much sir😩😭_

[@saurabhbhalla90]

It's a 14 minute video

[@akshayshelke7074]

😂😂

[@shwetajha8745]

This is the first video I've seen and I think I'll stick around this channel a lot.

[@gangamvaishnavi1724]

Sirrr plz come to our college and explain us data structures. We have suchh a worst faculty for data structure 😭😭...super explanation

[@osvaldoarellano8904]

Same, I need a professor like this!

[@richidubey]

we also hae succh a worst faulty. sair come too

[@mouneshvannur6675]

@@aadeshmishra5490 it is in ds and daa as well

[@ritik84629]

which college?

[@mahfuzurrahman9337]

which univrsty??

[@softwarain5674]

I can't explain how much your videos helped me in this subject please don't stop making these vidoes

[@bmpersonal6403]

Mr Bari, you really are such a talented teacher and individual. I really can't express my gratitude enough for all of these videos. You really make hard concepts easy to digest and I really thank you for that. I have both of your courses C++ and C++ DSA, as Im taking it to supplement my university lectures.

[@DDOMohit]

sir, i was watching it at 2x speed then i got stuck and reduce the speed to normal these 18 mins are much more fruitfull than most of 1 hr lecture thank you you made my day thank you so much sir

[@indrajeetsingh6882]

His slow voice with full of patience is epic

[@ajaywadhwa3398]

Thank you so much Abdul Bari, You are really comprehensive Teacher. Your videos always clears all the doubts. Your Videos are really helpful to us.

[@ankitkamble4050]

Dev maaanusss🙏🙏🙏

[@pradeepkumar-qo8lu]

Kharach

[@Amankumar-hh1pk]

Bhaalo maanus 😍

[@fahimismailmagdum8468]

One of the best comment....

[@shameemamutallib2769]

😘good

[@moisesacero4995]

yes exactly, I thought so as well.

[@_modestgreat]

I applied the algorithm on the array [8 4 6 5 0 1] and it wasn't perfect until I changed the condition while(a[i]

[@kritisingh2827]

Quick sort really scared me but now after understanding I realise this is so easy

[@shreza]

The ease with which you explain the algorithm is just mesmerizing, you make the topic look so simple to understand even if its very complicated. Please do make more videos. It's really very helpful.

[@seemaanjum1472]

I don't understand why some people have disliked the video. Sir has explained the concept from very basics and his explanations seems very convincing as well.

[@harshittaneja471]

u don't know he told wrong condition in inner while loop

[@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 < $h && a[$i] $l && a[$j] > $pivot) Keep uploading these wonderful videos which explain concepts very clearly... Regards, Ravish.

[@Kunalmarwah2192]

Really loved the way you taught this algo, the best video to learn quick sort. Thankyou so much sir :)

[@santosh5336]

He is so confident in the topic like he developed the method. He didn't make a mistake then get back and eraised it

[@saahil2121]

Wow. You made something that had confused me so long so simple and clear. Thank you for the video!

[@Darksider95]

Sir, i've been spinning around for hours trying to figure out why thrs an infinite loop on my quicksort implementation, and you are the only one that explained on that, to include the pivot for the left sub-array, thank you sir, you are amazing

[@focus9099]

He protects He attacs But most importantly: he's the best teacher on this earth and he is smart ;)

[@branislavzivanovic4775]

Mr. Abdul your a life saver! Going to college so i could learn almost 80% from KZbin.

[@psyche5184]

Not only is he good at algorithms, he is good at teaching them to us laymen.