Відео

thank you very much

Amazing !

This is superbbbb

Where it is used

It was the greatest thing i have ever seen!

incredible ♥

Do you add voices in the code? Or like using a video editor? Do you use manim CE or GL.

Helpful visualization and nice sounds!

happy new year and very very thank u 😍🥰

great explanation thanks alot

I don't know what I just watched but I like it😌

How do you do these sound effects?

So which one is the output?

great work it but it's way more confusing due to lack of the algo in vid

Thank you so much, it helped me understand it clearly.

Quick? This is very very slow.

I don't think if I ever forget Quicksort agian

Perfect

love this so much!!!! would be great brain rot with some sound design improvements

Huh, no jokes…. That’s sad. 😑

This is absolutely amazing. Honestly, when we discussed this in uni I almost fell asleep but you managed to make it so much more exciting. Like the others have already stated, it's obvious that you put a lot of effort into creating such a professional video. Kudos and keep up the great work 👍

sangat membantu aku suka

when the green is greater than orange we have to swap or when the orange is greater than green we have to swap?

that was not very quick

Hope you continue doing this stuff for other algorithms!, you deserve millions of subscribers

How to do you pick the pivot value

Wow , best explanation ❤

Nice video. Can you show it in a 3d plane?

This was one of the best and clearest explanations I have found. Awesome!

Vraiment spécial !!!

Please I need help. What do you write in the code to make the curve gradient. I've tried everything and it shows only one color, not gradient. Please help me 🙏🏻

Source code

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

Thanks!

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.

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

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

Great video, looks like I'm going to learn Manim

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

but... 0 is not greater than 5?

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

Awesome! Super! thank you!

wow youre like able to communicate from higher dimensions

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.

wow mindblowing this is a masterpiece

Code please......

Nice job!

criminally underrated content

great work

Perfect!