BATTLE OF THE SORTS: which sorting algorithm is the fastest? (visualization)

In this visualization, we run 10 different sorting algorithms in 5 minutes to determine which one is the fastest.

***************************************
JOIN Kite's Developer Community on Facebook ►

***************************************
OTHER COOL VISUALIZATIONS:

3 Levels of Sorting Algorithms - FASTEST Comparison Sort! ►

Simulating COVID-19 using Python, NumPy & Matplotlib [in-depth tutorial] ►

BIGGEST Codebases in History - Can you guess the largest? ►

***************************************
Don’t forget to subscribe :)

STAY TUNED:

[sanjacobs]

This is the sort of video that the YouTube algorithm will suddenly find in 4 years

[kellisuzuki]

selection sort: 1830 comparisons
bubble sort: 1809 comparisons
insertion sort: 968 comparisons
heap sort: 952 comparisons
merge sort: 287 comparisons
timsort: 566 comparisons
introsort: 280 comparisons
quicksort: 286 comparisons

[Autrone]

I like how you simplified and slowed it down enough for our casual eyes to see. I hope that the yt algorithm (heh) sorts you to the top!

[tannerprewitt]

You can't tell me 3:26 doesn't sound like boss music

[minhtoquang]

Props to whoever did the sound effects

[timlmazan]

Why didn't you include bogosort lol

(I'm kidding)

[JordanBeagle]

Nice, although the end card came up too quickly that I couldn't appreciate the glory of quicksort

[morkessler]

1:41
It’s not an Insertion Sort at all, it’s actually an Optimized Gnome Sort because it shows swaps in it, while Insertion Sort doesn’t have swaps

[yeahuh]

why didn't you put quantum sort?
it finds the correctly sorted list in all possible permutations.
like Bogosort, but instant.

[daveslamjam]

You're telling me that bubble sort isn't the worst? what?

[kellisuzuki]

me: *hm I do wonder which is fastest*
me after the video: I'm dumb, quicksort literally has "quick" in its name lol

[AleX-huci]

when part of it were already in order, this would be the time for timsort to shine ;)

[andyanderson]

Hm, heapsort is doing awful for O(n*logn), tbh. Great representation, btw. Thanks alot!

[rubikonium]

1:22 sounds like an incomplete F# major scale

[AbAb-thqe]

There is no one best sorting algorithm. Which one to use depends upon what where the data comes from and what state it's in at the outset (mostly already sorted for example). Radix sorting is good but some kind of incremental sort as data is recieved can still beat it if that's possible. Maybe you need to be able to access mostly sorted data before completion, which you won't get from radix sort.

[DrKsTsHdW]

3:06 Merge sort sounds like in Mario Bros. Classic, when you jump and hit a koopa or something. The comparison part of it reminds me of dig dug.

[arunsharma]

Babe I lied, there is no Netflix, today we are gonna watch sorting algorithms

[xbz]

nice video visualization, got a bit turned on actually

[JordanBeagle]

I assume different sorting algorithms are better for different applications, or does everyone just use quick sort?

[dhanisandyanto]

Start from 0:30 and set playback speed 0.25, you will hear nice melody