Learn Quick Sort in 13 minutes ⚡
Вставка
- Опубліковано 2 чер 2024
- Quick sort data structures and algorithms tutorial example explained
#quick #sort #algorithm
00:00:00 explanation
00:05:00 demonstration
00:07:47 code
// quick sort = moves smaller elements to left of a pivot.
// recursively divide array in 2 partitions
// run-time complexity = Best case O(n log(n))
// Average case O(n log(n))
// Worst case O(n^2) if already sorted
// space complexity = O(log(n)) due to recursion
music credits 🎼:
===========================================================
Title: A Caring Friend
Artist: Bad Snacks
Link: • bad snacks: UA-cam Au...
=========================================================== - Наука та технологія
This was the most difficult video I've ever made
It almost convinced me to quit coding tutorials 😩
You should give it a like, it would motivate me 👍
public class Main{
public static void main(String args[])
{
// quick sort = moves smaller elements to left of a pivot.
// recursively divide array in 2 partitions
// run-time complexity = Best case O(n log(n))
// Average case O(n log(n))
// Worst case O(n^2) if already sorted
// space complexity = O(log(n)) due to recursion
int[] array = {8, 2, 5, 3, 9, 4, 7, 6, 1};
quickSort(array, 0, array.length - 1);
for(int i : array){
System.out.print(i + " ");
}
}
private static void quickSort(int[] array, int start, int end) {
if(end
the fact that you just handle a new programmer/coder generation by yourself is really crazyy bro
Whoaaa how did ya do that simply :( ☺️
Quit coding tutorials! No that was one of the best technics you ever did. That effort brought this masterpiece, thank you.
Teach about ai
If only I could smash that like bottom more than once. You really deserve the " likes " bro. Thank you for your help bro.
I can`t believe that exists the guy who has knowledges of all Indian tutorials and he can explain it so aesthetically well. Keep it up! With love from Moscow
Are you saying we don't explain in an aesthetically well manner?? I'm taking offence to that.. jk 🤣
love from India.
@@NexushasTaken I am Indian, and I agree with you 🤣
@@synacktra why bro
@@NexushasTaken what's so annoying about our accent? I find it sweet and it varies from person to person
@@poulomidutta4997 it's not the accent, it's all the Tamil interjections that throw me off.
Fun fact, you can swap 2 numbers without a temp variable by doing the following
int a = 5;
int b = 10;
a = a + b; // 15
b = a - b; // 15 - 10 = 5
a = a - b; // 15 - 5 = 10
Not really useful, but a funny tip to know
ha-ha, so cool :) Thanks!
just finished ur entire java playlist and now the data structures playlist, this channel has really kept me busy this past summer and has really helped me out, never stop doing what ur doing!!
I am absolutely baffled how high quality your videos are. You make everything so easy and fun to understand and learn. Keep up the good work!
I quit my job as a data analyst at a big company to become a SWE. Your videos went from being a supplement to another resource to the main resource I lean on in many cases. When I crush my technical interview some time next year, I will let you know. Thanks bro. You are great at what you do and deserve all the success that comes to you.
Hello? I have same plan as you, would be great if we can share strategy to learn in this path
It has been 1 year..! Waiting for the news haha
It doesn’t matter if you have crushed or not, but you tried. That’s what matters the most. If you haven’t yet, let’s try together.
How did it go?
Guess it didn't go well.
I have been trying to understand quicksort by so many different teachers, videos, and forums and this video finally made me understand it. Thank You!
dawg your visual representations are absolutely saving me rn, love you
Thanks for the concise and clear explanation! Animation can be a pain but know that your hard work is definitely being appreciated
Something about quicksort was just not clicking with me before I found this video. I've never gone from being so confused by a concept to understanding it so well in such a short amount of time. I never comment on youtube videos but this absolutely deserved some praise. Well done and thank you!
4 minutes in, and I totally understand it now. Good job. Showing what happens each step helped. This is better than the other video I watched "explain in 4 minutes". Left my clueless. And with your video, I get it immediately.
Bro! Hats off to you man 😍 Completed the whole playlist 😎 All the basics are now fully cleared! Those real-life examples of stacks, queues, and LinkedList were awesome and all the shorting algorithms are now crystal clear. More power to you man.✌️🙏🙏
really unbelievable to have u who can put all those recursive and iteration into a movie like animation... just sitback, relax and enjoy what happens .........Awesome, truly awesome.....❤
I never understood Quicksort this easily until today. Exactly what I needed!
Such a good explainer and gem of youtube.
I will constantly support your videos bro! Kudos for all your efforts.
Finally, video without skipping recursive parts where are only two elements, now everything is much more clear, thank you.
I was just checking quick sort on UA-cam yesterday, glad you uploaded it
Thank you for the videos. They are extremely helpful. Right now, I'm taking Java classes but I rely on your videos to learn the concepts. I'm still a beginner but you have taught me a lot so far.
I never found a document or video explaining the Quick Sort algorithm this easy until I came to your channel. Hey bro, you're the best professor in the internet, ever!
Wow really good job! I love the visualization you did and appreciate that you finished out the array to firmly sitck the lesson in mind. Thank you!
You won the quicksort explanation game my dude, well done. I finally got it, THANK YOU 👏
This dude deserve 10 million subs
This is probably the easiest way anyone has explained any algorithm to me to this day!! Thanks, bro!!
Yes finally, I learnt this algorithm. A big thanks for this short and concise tutorial
You're the best bro. The writing code with narration section is insanely helpful
I have never seen someone explain and code so easily....this was the best! you are the best!
This is the best video i have seen so far. Straight to the point. Very helpful, Keep up the hard work
Amazing tutorial! Keep educating all of us like this ! I loved it. So elegantly and smoothly done..❤
Finally some quality content, easy to understand, Thanks!
Best explanation I have found till date. I cannot thank you enough.
so happy to always find what im looking for here! thank you so much!
I don't usually comment on videos, but I couldn't help myself from taking my hat off to you.
I'm currently reading an amazing book "Grokking algorithms", and I Just got to the part about quick Sorting, and while he explained it amazingly and I could understand the concept of it and even visualize it, he uses python on his exemples in the book, so it was extremely hard for me to come up with an implementation of the function in java, since here you can't just add and remove elements from and array like in python... So I was looking for videos that explained neatly the implementation of quick sorting in java I couldn't find any that really helped me, but then I remembered THE LEGENDARY BRO CODE! And it just clicked! Thank you so much man!
My first pieces of basic programming information came from you and I am very thankful because of how concise your code is... The way you pay attention to the convention and the way you write your code elegantly in a way that is easy to read and understand... I try to implement that when I'm writing code and all thanks to you! Keep up the good work, bro!
This channel provides so much free information. It's just too good to be true.
Love this channel growing!
thx bro, you are a life saver!!! keep up the good content and you have my total support! thx a lot. cheers
This is so cool and clear! Good job on the video!
You are saving lives Bro,please continue your hard work. Sorting algorithm is very difficult to explain, you handle it like a Pro Bro
Love it love it love it frrrr like I couldn't understand this at all from many videos but this made it so easy for me thankkkkss!!!
I understood these concepts better from this channel than I did in my 5-month DSA semester paper.
I watched up to the end of the visual explanation, which was very helpful and good by the way. Now I'm going to try and code it myself before watching how you code it
im grateful for these vids, i have a book about algorithms and data structure but i cant understand a word. your vids are so easy to digest and very helpful toward beginner like me
I had a task to implement the quicksort algorithm in assembly.This video helped me a lot to write the code as i could easily reference my results to yours.Thank you!(It took me around 6 hours of coding to do that lol)
This is my first comment ever and I really wanted to THANK YOU a lot. You are a great teacher. I am really appreciating your work. Thank you.
That was awesome and easy to understand explanation! Thank you so much!
Finally someone who explains quicksort nicely. Thanks so much bro
You're a monster Bro!! That was amazing explanation about this topic. Keep it up! Thanks for sharing with us!
Thanks so much. This algorithm has been the bane of my existence for way too long, and I finally get it now.
The way you implemented quicksort is much better than the other method I found. The other method has this stupid edge-case I can't wrap my head around. Thanks :)
This is the first time I understand quicksort, thank you
Writting this myself relying only on your explanation and demonstration but not looking at your code was a pain in the ass but I managed to do it !!! 💪
I am feeling a little bit smarter now lol
Your visual explanation is on point!!
Wow brilliant explanation .thank you so much
Man you are a legendary giga chad coder
your explanation is so good
I've never been this grateful to anyone before
Thanks a lot for this explanation... You are definitely the best java teacher...please continue creating more java algorithms...👏👏👏
Man i qas trying a whole day to understamd quick sort and now i understood in almost 15 min! You are a legend
Wow, this has been the best video that i have found about this topic
*i starts at -1 index, j starts at 0 index
*if array[j] >= array[pivot], increment j
*if array[j] < pivot, increment i and swap array[i] and array[j], then increment j
*once j reaches the pivot, increment i, and swap array[i] and array[pivot]
Thanks so much for making this, Bro Code, I am not exaggerating when I say this is the only video on the subject that made sense to me (without leaving out crucial details)! Your videos have helped the programming community so much!
Great job. You explained it well. Good visualisation.
This is the best explaination of quicksort ever made ♥️♥️♥️
the best quick sort tutorial!! I don't even use Java, but I understood with this explanation. Thank you
Awesome explanation and useful animation!
Hey bro please continue to do this serie, is very helpful. You are a great teacher. Hello from Brazil!
the best video on youtube to understand quicksort .
Thanks bro after watching your i understood the logic more clear.The way you explain algorithms by dry run is excellent
Amazing explanation, very easy to understand.
Amazingly explained bro! Thanks.
The best explanation in the youtube world Thank you very much bro
For those wondering, line 29 of the quick sort should be: for( int j = start; j < end; j++ ) {
And NOT: for( int j = start; j < end****-1****; j++ ) {
Still, great tutorial and they posted the correct code in the comments, just hope this helps those that are getting the wrong result and can't figure out why.
I'm so grateful for this video, i finally understood Quick Sort all thanks to you
thank you so much ❤❤❤
Seriously words cannot explain the efforts u have put in for us !! I'm 18 I'm from India U are helping me so much 💕 thanks bro
Thank you bro, now I understand algorithms, you teach better than in university ❤
Yeah, Bravo!! I have watched a dozen videos on QuickSort. I use it every day as a developer, but this video is the best to explain it to yourself or others, in why you made a particular design decision or not. I pick my partitions carefully, and for just the reasons stated in this video. This video helps me to explain to others why I made the decisions I did!!! Thanks!
After reading your comment above, I just want to say, seriously, dozens of videos, I watched on the topic and this is by FARRRRRRRRRRRR the BEST! This is what people want to see, they just don't know it yet. Keep up the good work!!!!!
Thanks a lot for putting such a great effort to teach us.
You are programming Jedi Master. I appreciate it
This is the best quick sort video I have ever seen
Great video and well explained!
I'm currently taking a course in datastructures and algorithms and your videos are a perfect resource.
It turns out that the pivot element is better chosen by calculating the median-of-three than choosing the first or last element in the array. This is because the runtime can be greatly improved and we are no longer taking the risk of having quadratic runtime as we now can get linearithmic runtime.
In theory, the best pivot value is the median of the array but since it's not possible to calculate for an unsorted array, we calculate the median-of-three. The median-of-three is the median of the first value, midmost value and the last value.
What happens is that the partitions splits up at almost equal parts, which makes for the better performance. ✌️
U made itvery easy to understand..thank you so much 😊
Bro! Amazing job. Thank you
Tysm, this video helped me a lot.
love these visual representations
your videos are really helpful, Thanks !
Thank you so much Bro, your Tutorial help me so much in learning code. Hope many success come to you, Bro
love the background music, its awesome bro
It's a very helpful series. Let make more videos like this...
Well done Bro! thanks from Brazil!!!!
I have my exam on Databases & Algorithms later, these videos are useful. Wish you could also create one for the Cocktail Shaker Sort and LSD Radix Sort.
Really good video.Understanding the content was really easy and fun.Thanks alot ❤.
I found quicksort really confusing until I watched this video. Thanks a lot bro, I hope you make more videos.
This is my fav. Playlist!
Cool!, Really cool!
It helped me understand how QS works.
thanks bro needed this for my college quiz very helpful
Great explanation!
quick sort learned! thanks!
amazing amazing amazing explanation
thank you, bro, you're the best!
My man is better than any university prof XD
Amazing video! can you do another one for the analysis of its time complexity? would be great :)
hope you will talk about radix sort, counter sort, heap sort and shell sort
Bro given this is a difficult topic, i now undersatnd it very well and i couldnt wrap me heard around the recurvive call and how the array is partitioned only, seeing the method signature and how you well explain this. Thank you so much never stop helping us younger generation. Thank God to your C# TUTORIALS i passed my firtst year 2023 and now im able to understand data structures and algorithms in Java. Thank you Man may God Bless you. Your Fellow Bro from SOUTH AFRICA🤗❤za
i was struggling with recursion but you helped me understand it better !!