Sorting AlgorithmsBeginner

Selection Sort

Finds the smallest element and moves it to the front repeatedly. Each iteration "selects" the minimum from remaining elements and places it after the sorted portion. Simple to implement with minimal memory usage, but always takes O(n²) time regardless of input.

#sorting#comparison#in-place#unstable

Complexity Analysis

Time (Average)

O(n²)

Expected case performance

Space

O(1)

Memory requirements

Time (Best)

O(n²)

Best case performance

Time (Worst)

O(n²)

Worst case performance

Step: 1 / 0
500ms
SlowFast
Keyboard Shortcuts
Space Play/Pause StepR Reset1-4 Speed

Real-time Statistics

Algorithm Performance Metrics

Progress0%
Comparisons
0
Swaps
0
Array Accesses
0
Steps
1/ 0

Algorithm Visualization

Step 1 of 0

Initialize array to begin

Default
Comparing
Swapped
Sorted

Code Execution

Currently executing
Previously executed

Implementation

Selection Sort - Algorithm Vision