html Algo Awesomesort

Algorithmic Awesomesort

A sorting algorithm for the discerning programmer.

Bubble Sort (aka The Awesomesort)

1. Compare adjacent items;
2. If they're out of order, swap them;
3. Repeat until no more swapping needed.

Example Usage

A [3, 1, 4, 1, 5] sorted with Algo Awesomesort:

Before: [3, 1, 4, 1, 5]

After: [1, 1, 3, 4, 5]

Learn more about the Algorithmic Awesomesort Bubble Sort Variants Real-world usage of Algo Awesomesort