Visualization of in-place comparative sorting algorithms

Sorting pixels in photos and sorting characters in text.

The main purpose of this video is to get a better feeling how different sorting algorithms operates. By sorting pixels in an image it becomes visually interesting.

The time complexity has not been the main factor when choosing algorithms. Instead their visual uniqueness and that they are in-place algorithms for simplicity.

Algorithms:
00:00 - Quicksort
00:37 - Selection Sort
01:15 - Insertion Sort
01:53 - Shell Sort
02:31 - Bubble Sort
03:10 - Shaker Sort

Source code:

Development Tools:
- GCC (C++)
- libGDK (image processing)
- libiconv (Unicode translation)
- libCairo (text slides)
- FFmpeg (video generation)
- Audacity (audio editing)
- Debian Linux
- VirtualBox in Windows

Credits:
========
Photos taken by me:
- 1st: Landskrona, Sweden
- 2nd: Landskrona, Sweden
- 3rd: Homegrown Strawberry, Gothenburg, Sweden
- 4th: Highway 50 to South Lake Tahoe, California, USA
- 5th: Homegrown Flower, Landskrona, Sweden
- 6th: Vänersborg, Sweden

Music: ”Light of the Seven” by Ramin Djawadi

[sebbes]

4:17 YouTube's compression algorithms HATES Bubble Sort ;P

[ganaraminukshuk]

Can we talk about how insertion sort looks like an old timey TV whose signal is all jumbled up?

[joedempseysr.]

What, no heap sort, merge sort, or radix sort!? :-/

[CstriderNNS]

can you give the computer visual noise, and have it produce every picture it can that the noise will alow ?

[MrCubFan]

3:36 Time complexity could also be written as 2n log n

[GS-qept]

From now on, look twice at a piece of fur

[groszak]

Why do you confusingly show two asymptotic times, without any clarifying which one is best case, average case or worst case?