Quick Sort Algorithm

preview_player
Показать описание
​Quick Sort is a sorting algorithm based on partitioning the array of data into sub-arrays to sort them recursively.

This video is produced with the animation engine Manim.

Manim Animation

Thanks for watching.
Рекомендации по теме
Комментарии
Автор

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

tobotis
Автор

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

gairick
Автор

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

maxpo
Автор

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

sreeharsharaveendra
Автор

Oh my god. I always forget the Quick sort. I will come back to this video whenever I need a refresher.

santanu
Автор

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.

gersonadr
Автор

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.

DarongQi
Автор

Thank you. Visually seeing it happen finally helped me understand the different operations happen and their order

avnpl
Автор

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

slivkask
Автор

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.

NarayanadasuMeghana
Автор

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.

MrJbauer
Автор

Thank you a lot !!!

Simply using sound effects instead of music is by far more relaxing and helpful !

vezzz
Автор

The best explanation on all of YouTube!

fridericusrex
Автор

Most amazing animation to explain quick-sort

dhruvkumar-brlp
Автор

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.

HeenaTabassum-yz
Автор

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.

arlessonlima
Автор

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.

prashantagarwal
Автор

Simple and straight to the point, good job

levi
Автор

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

ДмитроІльків-жи
Автор

This video is so underrated, amazing explanation!

lainbit