Quick Sort Algorithm Explained PATREON : www.patreon.co... Courses on Udemy ================ Java Programming www.udemy.com/... Data Structures using C and C++ www.udemy.com/... C++ Programming www.udemy.com/...
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.
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.
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
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. 😘😘😘
@@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
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.
@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
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.
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.
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
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.
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 😊.
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!
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.
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! :)
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.
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
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
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.
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
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.
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 🙏
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....
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.
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).
@@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.
@@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
do{ i++; } 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 && j >= left)
this is the commet that I was looking for. Just in case, in Java the range's check condition have to be at the beggining (short circuite). I mean: while(i < right && A[i]
"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.
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🎉
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.
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.
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
Big thank you for taking a time to share your knowledge and make easier for us to learn. I understood the concept after watching the video, however, there is something that need to be added on both whiles in the Partition function. Just need to check the array indexes, otherwise, we'll exceed the boundaries of the array, something like this: for the i-while while (i < hight && array[i] low && array[j] > pivot); All the rest is just great. Thank you
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.
this is brilliant explanation. So concise and yet so complete. I am reading the idea of infinity in Quick sort for the first time and it was so easy to grasp.
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.
He really explained the topic very well. I've seen many videos but only learnt "how to do" but he's only who taught "why to do". We lack these type of true teachers. 🙌🙌
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
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 < $h && a[$i] $l && a[$j] > $pivot) Keep uploading these wonderful videos which explain concepts very clearly... Regards, Ravish.
I was seaching for the explanation of this algorithm since yesterday. No one could explain me clearly until I saw your explanation. Thank you very much sir 🙏
I am having one confusion...since we have used do while loop in partition function...so it would increment i by one and decrement j by 1 even if the condition is false and then it will swap those two. So here i think these kind of swapping might create some problems.