filmov
tv
CLI visualization of 17 sorting algorithms (+5 variants) under 10 minutes

Показать описание
The classic bleep-bloop thing in computer science.
A command-line visualization of 17 sorting algorithms (including 5 variants of certain sorting algorithms).
Careful it may sound a little... sharp
This is a re-upload of my previous video "28 Sorting Algorithms under 13 minutes". The sound quality has improved since then.
Algorithms showcased:
00:00 Selection sort
00:20 Insertion sort
00:42 Binary insertion sort
00:56 Quick sort
01:12 Quick sort (random pivot)
01:28 Merge sort
02:02 Heap sort
02:42 Radix sort (least significant digit first)
03:01 Radix sort (lsd alternate implementation)
03:26 Radix sort (most significant digit first)
03:46 Introspective sort (quick-heap-insertion)
04:03 Tim sort (3 minimum runs)
05:26 Shell's sort
05:51 Shell's sort (ciura's version)
06:13 Bubble sort
06:42 Cocktail shaker sort
07:05 Gnome sort
07:33 Bitonic sort
08:13 Circle sort
08:55 Cycle sort
09:46 Stalin sort
A command-line visualization of 17 sorting algorithms (including 5 variants of certain sorting algorithms).
Careful it may sound a little... sharp
This is a re-upload of my previous video "28 Sorting Algorithms under 13 minutes". The sound quality has improved since then.
Algorithms showcased:
00:00 Selection sort
00:20 Insertion sort
00:42 Binary insertion sort
00:56 Quick sort
01:12 Quick sort (random pivot)
01:28 Merge sort
02:02 Heap sort
02:42 Radix sort (least significant digit first)
03:01 Radix sort (lsd alternate implementation)
03:26 Radix sort (most significant digit first)
03:46 Introspective sort (quick-heap-insertion)
04:03 Tim sort (3 minimum runs)
05:26 Shell's sort
05:51 Shell's sort (ciura's version)
06:13 Bubble sort
06:42 Cocktail shaker sort
07:05 Gnome sort
07:33 Bitonic sort
08:13 Circle sort
08:55 Cycle sort
09:46 Stalin sort