For future watchers/viewers • (dot) is the index position. [•] (dot in brackets) is the element at index • (dot) Comparing only the • dots means comparing the index positions of the • dots only and not the elements at • the dots. Thanks a lot, this video was the only one that helped me understand this algorithm. Much respect.
I have watched so many videos on quick sort.but i didn't understand all of them, but this video makes me sense. and i have understood it very perfectly.
Congratulations on this animation. I had never understood what the swap rule was like between current position value and swap position value. With this animation I understood that after increasing the exchange position by 1, its value must be exchanged if the value of the current position is less than that of the exchange position, this way the exchange position will always contain a value less than or equal to the value of pivot.
This is one of the best channel to learn computer science concepts in general.Please keep creating and posting more videos as these animations are highly useful in understanding the underlying concepts.Can you please share the manim code you used to create this animation.
Your videos are really do easy to understand. I understood all sorting techniques through your videos. Can you please make videos on linked list concepts please. It would help us in better understanding. U guys are doing a great job, hope u continue it and go ahead.
Actually there is an error in the drawn condition for swap green and orange, it should be inverted. At 0:45 it swaps 0 with 5, but according to condition 'green > orange' (0 > 5) it should not. So the correct condition is 'green < orange' (0 < 5). We are sorting ascending and not descending. ✌
It looks like this is not an issue. The green and red dots represent the indices in the array so 'green > blue' states that if green is at a higher index than blue then swap (not values!). Later once green is smaller than or equal to 4 (pivot) then the new incremented position of yellow is more than the pivot. If the new green element is less than the pivot then it is obviously less than the new incremented yellow value as well.
@@eauploads3677 i saw that error too but after @smartrabbitvideos9384 reply I realised that dot with square brackets [dot] represents value and only dots represents index
I got confused, too. I read a comment from the channel's owner, who commented under someone else's comment. We need to look at the indices, not the element inside the array. Below is his comment: "Thanks for your interest. • (dot) is the index position. [•] (dot in brackets) is the element at index • (dot) Comparing only the • dots means comparing the index positions of the • dots only and not the elements at • the dots. A detailed explanation at 0:15 would have been helpful."
green dot is iterator.. like i in for loop. orange dot keep track of elements what are smaller than the pivet. steps: 1. select the pivet. (last element) 2. traverse through the array and compare each element with the pivet. if it finds element less than the pivet, move orange dot one place. then swap places.(this action move elements that are less than pivet, close to each other.) 3. if green dot goes to the pivet, then again move green dot one place and swap it with the pivet. now we have the pivet in place where it placed correct place it should be. do this recursively
This was very helpful, but I had a hard time understanding the intent behind the seemingly simple operations for the partitioning. A slide at the start with some text would have been helpful. Here's the idea if anyone else struggled understanding it. You have a moving pivot (orange) and a swapper (green). The moving pivot (which starts at -1) maintains a territory to it's left (and where he currently is) of numbers which are smaller or equal to the pivot. The swapper looks for the numbers which are smaler than or equal to the pivot and moves them into the moving pivot's territory.
I have a confusion in some video I saw when we choose pivot in left side greater element is search from left to right and smaller is right to left and you are doing both from the same side is it same ?
quick sort goes left to right. so green and orange will be on the left. you can choose any number as the pivot index but you will put it to the right of the list and then do this process in the video.
Wow it takes so much afford to animate this.... respect
This is so easy if you know python programming and it is used a package called manim
effort bro
@@Abdihakim-comhow bro can you explain it further
The most beautiful UI, UX design to explain quicksort algorithm. Sounds, visual cues, animation is too good.
this was so insanely good. deserves 10mil+ views honestly
indeed, at least 8 billion views
@@EliAxel More, like 9 Nontilion views
Really helpful! Contrast to those ultrafast animations, this helps to feel out how does algorithm work. Well done!
Oh my god. I always forget the Quick sort. I will come back to this video whenever I need a refresher.
Thank you. Visually seeing it happen finally helped me understand the different operations happen and their order
For future watchers/viewers
• (dot) is the index position.
[•] (dot in brackets) is the element at index • (dot)
Comparing only the • dots means comparing the index positions of the • dots only and not the elements at • the dots.
Thanks a lot, this video was the only one that helped me understand this algorithm. Much respect.
This is amazing. I've learned more in this 2min video than any CS lecture or self study. Please do one for every key concept in CS.
The best explanation on all of UA-cam!
Thank you a lot !!!
Simply using sound effects instead of music is by far more relaxing and helpful !
Hope you continue doing this stuff for other algorithms!, you deserve millions of subscribers
This was one of the best and clearest explanations I have found. Awesome!
I have watched so many videos on quick sort.but i didn't understand all of them, but this video makes me sense. and i have understood it very perfectly.
Most amazing animation to explain quick-sort
Thank you so much, it helped me understand it clearly.
Congratulations on this animation. I had never understood what the swap rule was like between current position value and swap position value. With this animation I understood that after increasing the exchange position by 1, its value must be exchanged if the value of the current position is less than that of the exchange position, this way the exchange position will always contain a value less than or equal to the value of pivot.
Simple and straight to the point, good job
Woah!!!! This was amazing dude. Keep making such videos :)
This video is so underrated, amazing explanation!
Only after watching 1M videos, I landed on the best one. I can now write the code myself after understanding the depth. Thanks a lot!
you boy makes this really easy........this 3 minutes are fascinating!
In one way or another now I totally get quicksort. thank you for the video.
the best visual explanation! I really liked it and it was beneficial! Also, it's my first comment) you really deserve it!!!
Wonderfully made thank you so much, exam in 9 hours.
wow mindblowing this is a masterpiece
happy new year and very very thank u 😍🥰
great explanation thanks alot
This is one of the best channel to learn computer science concepts in general.Please keep creating and posting more videos as these animations are highly useful in understanding the underlying concepts.Can you please share the manim code you used to create this animation.
I think this one is the best one in terms of visualization.
I don't think if I ever forget Quicksort agian
It's really amazing and the animation with the sound are really cute
i love the sounds too!
Best 4k video of all time
Your videos are really do easy to understand. I understood all sorting techniques through your videos. Can you please make videos on linked list concepts please. It would help us in better understanding. U guys are doing a great job, hope u continue it and go ahead.
I love the sound effect thank you
Awesome work . Thank you so much
the best video i`ve ever seen.
Actually there is an error in the drawn condition for swap green and orange, it should be inverted. At 0:45 it swaps 0 with 5, but according to condition 'green > orange' (0 > 5) it should not. So the correct condition is 'green < orange' (0 < 5). We are sorting ascending and not descending. ✌
It looks like this is not an issue. The green and red dots represent the indices in the array so 'green > blue' states that if green is at a higher index than blue then swap (not values!). Later once green is smaller than or equal to 4 (pivot) then the new incremented position of yellow is more than the pivot. If the new green element is less than the pivot then it is obviously less than the new incremented yellow value as well.
@@smartrabbitvideos9384 at the start of the video, the green and orange dots were said to represent element at index not index
@@eauploads3677 only if there is a bracket around it, if not then it represents the indices
@@eauploads3677 i saw that error too but after @smartrabbitvideos9384 reply I realised that dot with square brackets [dot] represents value and only dots represents index
what you said is correct
There seems to be an error in the video. At the bottom the decision tree guide displays green > yellow, where it should be the other other way around.
yup
It refers to the index position, not the value of swap marker in the array
No, the video is correct. Like the other commenters said, the orange and green dots represent the indices in the list, not the elements themselves.
I got confused, too. I read a comment from the channel's owner, who commented under someone else's comment. We need to look at the indices, not the element inside the array. Below is his comment: "Thanks for your interest.
• (dot) is the index position.
[•] (dot in brackets) is the element at index • (dot)
Comparing only the • dots means comparing the index positions of the • dots only and not the elements at • the dots.
A detailed explanation at 0:15 would have been helpful."
beautiful animation
great explanation thanks alot
great presentation pal! Thanks
0:32 why 2 is not swapped after +1 it will become 3 which is less than pv?? It need to swap
If had millions of dollars, I would have given you one.
criminally underrated content
Short and easy :)
Good Job!!
finally found the gem.
It was the greatest thing i have ever seen!
Really nice animation
OMG this is beautiful!!! 💖😍
Can u plz provide the code
it hurts to see this not getting enough credit😔
most satisfying tutorial
green dot is iterator.. like i in for loop.
orange dot keep track of elements what are smaller than the pivet.
steps:
1. select the pivet. (last element)
2. traverse through the array and compare each element with the pivet. if it finds element less than the pivet, move orange dot one place. then swap places.(this action move elements that are less than pivet, close to each other.)
3. if green dot goes to the pivet, then again move green dot one place and swap it with the pivet.
now we have the pivet in place where it placed correct place it should be.
do this recursively
Nice easy to understand ❤❤
This was very helpful, but I had a hard time understanding the intent behind the seemingly simple operations for the partitioning. A slide at the start with some text would have been helpful.
Here's the idea if anyone else struggled understanding it.
You have a moving pivot (orange) and a swapper (green).
The moving pivot (which starts at -1) maintains a territory to it's left (and where he currently is) of numbers which are smaller or equal to the pivot.
The swapper looks for the numbers which are smaler than or equal to the pivot and moves them into the moving pivot's territory.
Fantastic animation
This example uses Lomuto's partitioning algorithm.
Amazing job!
Isn't there an error? At the bottom-right, the condition for swapping should be [green < orange], not [green > orange]
This was great!
Yussss this is what i needed. sank you
Wow Wow such a nice animation thank you
Alright! So how to merge them all in the end? I should maintain a map to hold each value at each index?
this doesn't work with multiple duplicate elements in an array, maybe someone can help me with 40420 I get stuck at 424 with pivot 4
Can you share the code. For the learning prospects. Please
Beautiful ❤️
WOW!! The animation explains the sorting algorighm in easiest way!! Just wondering could you share the colab notebook code of that animation?
I have a confusion in some video I saw when we choose pivot in left side greater element is search from left to right and smaller is right to left and you are doing both from the same side is it same ?
Thanks!
This is the best explanation for me
very good
THAT S AMAZINGGG
Awesome video,🙌
incredible ♥
really amazing
when the green is greater than orange we have to swap or when the orange is greater than green we have to swap?
great work
How to make these kind of animations!
loovoly video mate thanks alot
How to do you pick the pivot value
just pick the arrays last element as pivot
can you please explain how to decide orange and green's position (index) according to pivot ?
quick sort goes left to right. so green and orange will be on the left. you can choose any number as the pivot index but you will put it to the right of the list and then do this process in the video.
0:53 Current index is not greater than swap index. Why does it still swap?
it was checking the index position, not the element of index
I want a source code of this animations
7 to 6 in the third level, it dint exchange the value ?? y
Amazing!
Nice sound effects. How did you sync them so perfectly with the animations?
manim has built-in methods for that purpose. You can pair sound effects with the animations you want
This does not handle duplicates if you check when you swap if current value == pivot
Even a kindergarten kid can understand it seeing this video, DAMN!
Thanks man.
good job.
Perfect
Wow gargeous 😮 👌👌
Nice video aesthetic
Insanely good
love this so much!!!! would be great brain rot with some sound design improvements
Thank you! Best video on Quick Sort!
Great animation ! just would like to ask about the source of the sound effects
thanks you so much😍
sangat membantu aku suka
Please make more videos on other sorting methods.