Quick Sort Algorithm 

Wow it takes so much afford to animate this.... respect

this was so insanely good. deserves 10mil+ views honestly

The most beautiful UI, UX design to explain quicksort algorithm. Sounds, visual cues, animation is too good.

Really helpful! Contrast to those ultrafast animations, this helps to feel out how does algorithm work. Well done!

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

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

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.

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.

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.

Thank you a lot !!! Simply using sound effects instead of music is by far more relaxing and helpful !

Most amazing animation to explain quick-sort

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.

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.

The best explanation on all of RU-vid!

Wonderfully made thank you so much, exam in 9 hours.

WOW!! The animation explains the sorting algorighm in easiest way!! Just wondering could you share the colab notebook code of that animation?

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.

Simple and straight to the point, good job

Nice sound effects. How did you sync them so perfectly with the animations?

you boy makes this really easy........this 3 minutes are fascinating!

Isn't there an error? At the bottom-right, the condition for swapping should be [green < orange], not [green > orange]

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 video is so underrated, amazing explanation!

In one way or another now I totally get quicksort. thank you for the video.

I think this one is the best one in terms of visualization.

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!

Woah!!!! This was amazing dude. Keep making such videos :)

Thanks!

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

Alright! So how to merge them all in the end? I should maintain a map to hold each value at each index?

wow mindblowing this is a masterpiece

Awesome work . Thank you so much

beautiful animation

I love the sound effect thank you

It's really amazing and the animation with the sound are really cute

great explanation thanks alot

it hurts to see this not getting enough credit😔

finally found the gem.

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 ?

Best 4k video of all time

Great animation ! just would like to ask about the source of the sound effects

If had millions of dollars, I would have given you one.

thanks for the animation but there's a slight mistake in ---> [green] [orange+1] ----> [ green] > [ orange] ===> it should be [orange] >[green] then swap If I'm not wrong. wouldn't have figured the algo without your animation( I've figured the error cuz of that) again thanks!!!!!!

great presentation pal! Thanks

This example uses Lomuto's partitioning algorithm.

Fantastic animation

most satisfying tutorial

criminally underrated content

Can u plz provide the code

very good

Nice easy to understand ❤❤

great work

Thanks

the best video i`ve ever seen.

Short and easy :) Good Job!!

Wow Wow such a nice animation thank you

really amazing

terimakasih, daya sudah mengerti quicksort 5 menit sebelum ujian

Really nice animation

Can you share the code. For the learning prospects. Please

How to make these kind of animations!

Beautiful ❤️

OMG this is beautiful!!! 💖😍

Thanks man.

amazing

the best visual explanation! I really liked it and it was beneficial! Also, it's my first comment) you really deserve it!!!

This does not handle duplicates if you check when you swap if current value == pivot

good job.

can you please explain how to decide orange and green's position (index) according to pivot ?

This was great!

0:32 why 2 is not swapped after +1 it will become 3 which is less than pv?? It need to swap

Even a kindergarten kid can understand it seeing this video, DAMN!

Amazing job!

thanks you so much😍

I want a source code of this animations

Awesome video,🙌

loovoly video mate thanks alot

Is this Hoare schemes? Why it looks different?

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

THAT S AMAZINGGG

does this mean if "index" is greater than "swap marker" they will swap?

Please make more videos on other sorting methods.

Yussss this is what i needed. sank you

green>orange isn't it wrong? actually orange >green, before swap

This is the best explanation for me

0:53 Current index is not greater than swap index. Why does it still swap?

Insanely good

Wow gargeous 😮 👌👌

Does there seem to be a problem at green > orange => swap ???

perfectly explained

Amazing!

7 to 6 in the third level, it dint exchange the value ?? y

this is crazy

Nice video aesthetic

What a great videos! however, I think the "greater than" operator comparing green with orange should be less than, and you have greater than. when you compare 5 with 0, zero(green) is less than 5(orange), and you have swap if green is greater than orange. It should be backwards really great video tho.

1:22 why swap if green is not bigger than orange?

Finelly!!!

BESTT