File:15 Sorting Algorithms in 6 Minutes.webm
Summary
| Description |
English: Visualization and "audibilization" of 15 Sorting Algorithms in 6 Minutes.
Sorts random shuffles of integers, with both speed and the number of items adapted to each algorithm's complexity. The algorithms are: selection sort, insertion sort, quick sort, merge sort, heap sort, radix sort (LSD), radix sort (MSD), std::sort (intro sort), std::stable_sort (adaptive merge sort), shell sort, bubble sort, cocktail shaker sort, gnome sort, bitonic sort and bogo sort (30 seconds of it). |
| Date | |
| Source | 15 Sorting Algorithms in 6 Minutes - YouTube |
| Author | Timo Bingmann |
Licensing
.svg){kind=icon}
This video, screenshot or audio excerpt was released under the Creative Commons license option on YouTube before August 2025. (YouTube changed the license version from CC BY 3.0 to 4.0 on August 1; this was not retroactive.)
For videos uploaded or licensed after July 2025 use {{YouTube CC-BY 4.0}}
To the uploader: You must provide a link (URL) to the original file and the authorship information if available.
This file is licensed under the Creative Commons Attribution 3.0 Unported license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
 |
This file, which was originally posted to
15 Sorting Algorithms in 6 Minutes - YouTube, was reviewed on 12 July 2016 by reviewer Rodrigolopes, who confirmed that it was available there under the stated license on that date. |