File:15 Sorting Algorithms in 6 Minutes.webm
Original file (WebM audio/video file, VP9/Opus, length 5 min 50 s, 1,280 × 720 pixels, 307 kbps overall)
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).
|Source||15 Sorting Algorithms in 6 Minutes - YouTube|
Their website states: "YouTube allows users to mark their videos with a Creative Commons CC BY license."
|This file, which was originally posted to 15 Sorting Algorithms in 6 Minutes - YouTube, was reviewed on by the administrator or reviewer Rodrigolopes, who confirmed that it was available there under the stated license on that date.|
Click on a date/time to view the file as it appeared at that time.
|current||14:10, 26 November 2015||5 min 50 s, 1,280 × 720 (12.78 MB)||Zhuyifei1999||User created page with UploadWizard|
- You cannot overwrite this file.
File usage on Commons
Transcode statusUpdate transcode status
|WebM 720P||574 kbps|
|Completed 14:19, 26 November 2015||9 min 37 s|
|WebM 480P||391 kbps|
|Completed 14:18, 26 November 2015||8 min 22 s|
|WebM 360P||239 kbps|
|Completed 14:15, 26 November 2015||5 min 31 s|
|WebM 240P||196 kbps|
|Completed 18:51, 16 February 2017||3 min 26 s|
|WebM 160P||179 kbps|
|Completed 21:47, 16 February 2017||2 min 33 s|