The Sorting Algorithm Olympics - Who is the Fastest of them All

In this video, we race 7 sorting algorithms against each with lists of varying sizes. This is meant to demonstrate the different strengths of various algorithms, and show which you would be best using when given data sizes to sort.

I have included the Patreons that made this video possible below. Thank you for your support mates :)

Sources for original algorithms:
Quicksort:

Radix sort:
(Change the base to 256 if you use this code!)

Bubble Sort:

Selection Sort:

Insertion Sort:

Shell Sort:

Support What's a Creel? on Patreon:


Website:


FaceBook:


Music Channel:


Another channel with random things:


Patreons:
Alexander Dahlin
Alve Larsson
Augusto Righetto
Awon Ali
Blaz
Carsten Hansen
Cato Larsen
Chris Lidyard
Christer Borgqvist
Curtis Seizert
Darby Burbidge
dominic pace
Dominik Wyss
Floris Bob van Elzelingen
Geert Depuydt
Gurpreet Singh
James Mearns
Jeffrey Knuckle
Josef Aguilar
Joshua Smyth
Luke Duguid
Martin Champagne
Martin Cohen
Matheus Salvia
Matthew Livernoche
Micah Rust
Michael Pearce
Patreonic
Pavel Bibergal
Rahul Nair
Renwick Preston
Robert Jacobson
Roman Kozak
Ross Young
Steffen André Langnes
Taylor
Thomas
Todd Cullum
Tom Marazzo
Wathinti Abafazi
William Allen
Yichao Shen
Zhixun He



Software used to make this vid:
Visual Studio 2019 Community:

Synfig:

Gimp:

Audacity:

OBS:

Davinci Resolve 16:

sorting,algorithm,programming,tutorial,races,race,radix,quicksort,quick,std,stl,c++,insertion,selection,bubble,shell,shell sort,radix sort,testing,explained,demonstration,animated,animation,computer science,compared,visualised,visualized,comparison,complexity,big o,vs quicksort,vs radix,algorithms,example,software engineering,runtime,ranked,ranked by speed,