Infinitode / Experiments
Algorithm Controls
Algorithm
Selection Sort
Bubble Sort
Insertion Sort
Merge Sort
Quick Sort
Heap Sort
Radix Sort
Selection Sort
Selection sort works by repeatedly finding the minimum element from the unsorted part and putting it at the beginning.
Time Complexity:
O(n²)
Space Complexity:
O(1)
Array Size
50
Speed
200ms
Instant Sort
Sort without animation delay
Sound
Sound: ON
Generate Array
Start Sorting
Comparing
Swapping
Pivot
Minimum
Sorted
Status:
Ready
Comparisons:
0
Swaps:
0
Time:
00:00:000