Visualization of Quick sort (HD)
An animated demonstration of sorting algorithms.
Read about my new book, "Zuto: The Adventures of a Computer Virus", http://www.zutopedia.com, or visit my homepage, https://www.udiprod.com/
This video shows two comparison based sorting algorithms: Bubble sort and Quick sort.
The algorithms are demonstrated by robots sorting balls by hue. Comparison based sorting algorithms must make decisions based solely on pairwise comparison results. This is visualized by the robot's short-sightedness, which forces them to perform pairwise comparisons in a very pronounced manner.
The video culminates in a contest. Each algorithm is presented with an identical series of balls and they compete to see which finishes the sorting task faster. In addition to raw speed, the number of comparisons they perform is also measured.
Advanced viewers will notice bubble sort performs comparisons quicker than quick sort. This is because quick sort has to move around a lot between comparisons. Quick sort aims at reducing the number of comparisons, but in domains where movement is costly, it becomes inferior to other algorithms, which aim to reduce movement as well.
Видео Visualization of Quick sort (HD) канала udiprod
Read about my new book, "Zuto: The Adventures of a Computer Virus", http://www.zutopedia.com, or visit my homepage, https://www.udiprod.com/
This video shows two comparison based sorting algorithms: Bubble sort and Quick sort.
The algorithms are demonstrated by robots sorting balls by hue. Comparison based sorting algorithms must make decisions based solely on pairwise comparison results. This is visualized by the robot's short-sightedness, which forces them to perform pairwise comparisons in a very pronounced manner.
The video culminates in a contest. Each algorithm is presented with an identical series of balls and they compete to see which finishes the sorting task faster. In addition to raw speed, the number of comparisons they perform is also measured.
Advanced viewers will notice bubble sort performs comparisons quicker than quick sort. This is because quick sort has to move around a lot between comparisons. Quick sort aims at reducing the number of comparisons, but in domains where movement is costly, it becomes inferior to other algorithms, which aim to reduce movement as well.
Видео Visualization of Quick sort (HD) канала udiprod
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
Merge Sort vs Quick Sort15 Sorting Algorithms in 6 MinutesWhat's the fastest way to alphabetize your bookshelf? - Chand JohnVisualization of Quantum Physics (Quantum Mechanics)Quicksort: Partitioning an arrayCars: engine power and transmission - 3D animationProof That Computers Can't Do Everything (The Halting Problem)A Visual Riddle (The Epitaph of Stevinus)Listening to Sorting Algorithms!Heaps and Heap Sort50+ Sorts, Visualized - Color CircleSlow sorting: Stooge sort and Bogo sortQuick-sort with Hungarian (Küküllőmenti legényes) folk danceWhy My Teenage Code Was Terrible: Sorting Algorithms and Big O NotationInsertion Sort vs Bubble Sort + Some analysisVisualization of Tidal Forces50+ Sorts, Visualized - Reversed InputsWhy is Radix Sort so Fast? Part 2 Radix SortSorts 8 Quick SortThe Sorting Algorithm Olympics - Who is the Fastest of them All