π
BananaSort
Algorithmic Ripening v2.4
0
Comparisons
0
Swaps
β
Time (ms)
π Ripple Sort
aka Bubble Sort
O(nΒ²) Β· Like watching bananas ripen one by one
π Forager Sort
aka Selection Sort
O(nΒ²) Β· Always finds the ripest first
π Bunch Sort
aka Insertion Sort
O(nΒ²) Β· Sliding bananas into their bunch
π Split Sort
aka Merge Sort
O(n log n) Β· Divide the bunch, conquer hunger
π Machete Sort
aka Quick Sort
O(n log n) avg Β· One chop, two piles
π Monkey Sort
aka Shell Sort
O(n logΒ² n) Β· Long leaps, then fine-tunes
βΆ Sort Bananas
β³ New Bunch
β Stop
Array Size
60
Speed
Medium
Ripple Sort
πΏ The Lore
Select an algorithm and press Sort Bananas to begin the ripening.
π Operation Log
// awaiting ripeness signal...