2.8.1 QuickSort Algorithm

Quick Sort Algorithm Explained

Courses on Udemy
================
Java Programming

Data Structures using C and C++

C++ Programming

[MrRobot-gmcv]

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.

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

[seanpayne]

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

[shubhamn]

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.

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

[turtlepedia]

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

[thexxmaster]

Indian youtubers are the backbone of the new KNOWLEDGE ECONOMY

[kimjiyoung]

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

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

[livingbeing]

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.

[alperozdamar]

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.

[fitnesstravelwithdm]

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

[echoesofelysium]

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.

[EddieKnaz]

do{
i++;
} while(A[i] <= pivot)

do{
j--;
} while(A[i] > pivot)

will cause index out of bound.. easily given an array like [8, 10]
you need to add a condition to each while statement

do{
i++;
} while(A[i] <= pivot && i < right)

do{
j--;
} while(A[i] > pivot && j >= left)

[calebhoward]

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!

[manojprabhakaranm]

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

[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! :)

[bilalshafqat]

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.

[kartashuvit]

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] <= pivot. Same for the other one, check j > -1 first. Otherwise your extreme left/right partitions can run out of bounds.

[sumedhdeshpande]

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