Selection Sort Monster
An in-place comparison-based sorting algorithm. It divides the input list into two parts: a sorted sublist built up from left to right, and a remaining unsorted sublist.
0
Array Size
0
Comparisons
0
Swaps
0
Total Steps
SELECTION SORT
Execution Log
Ready to sort items. Click Play to start.
Sorting Challenge
Can you sort the array manually with the optimal number of swaps? Click any two bars to swap them.
š ļø Array Controls
Custom Array Input
ā” Algorithm Complexity
Worst-case Time
O(nĀ²)
Average Time
O(nĀ²)
Space Complexity
O(1)