Visualization and Comparison of 9 Sorting Algorithms (with 4 Different Data Type) Using Python

Visualization and comparison of 9 Sorting Algorithms: Insertion Sort, Shell Sort, Selection Sort, Merge Sort, Quick Sort, Heap Sort, Bubble Sort, Comb Sort, Monkey Sort.

The data used in this comparison consist of 4 different data types: random, almost-sorted, few-unique, and reversed.

The winner in this simulation is Shell Sort... while Monkey Sort (a.k.a. Bogo Sort, Lazy Sort, Permutation Sort, Bogo Permutation Sort) left the group chat xD

I hope you enjoy this video!

[JasonHadinata]

Almost sorted data set.

Monkey sort:

So you have chosen... death.

[pnintetr]

Quick sort was implemented naively. The lopsidedness issue can be ameliorated by choosing as a pivot the middle (i.e. (n+1)/2 th) element of each sublist, rather than an endpoint (i.e. first or last).

[sabata]

That didn't look like quick sort.

[algodoomarbleracing]

Monkey Sort is also known as Bogo Sort.

[_fluffyy]

That doesn't look like selection sort...