Selection Sort Visualizer

Setup Array

Sort Controls

Array Visualization

Algorithm Steps

How to Use

Setup: Enter numbers separated by commas or click "Random" to generate an array
Sort: Click "Start Sort" to begin the selection sort process
Step Through: Click "Next Step" to see each step of the algorithm execution
Run Through: Click "Run Through" to automatically execute all steps in sequence
Observe: Watch the array elements change colors and algorithm steps highlight on the right
Reset: Click "Reset" to start over with a new sort

Colors: Yellow = Current element, Purple = Largest so far, Red = Upper boundary, Blue = Comparing, Green = Sorted

Selection Sort Concept

Selection Sort is a sorting algorithm that repeatedly finds the largest element in the unsorted portion and places it at the end of the sorted portion.

How it works:

Find the largest element in unsorted section
Swap it with the last element of unsorted section
Reduce the unsorted section by one element
Repeat until array is fully sorted
Builds sorted section from right to left

Time Complexity: O(nÂ²) - compares all pairs of elements

Use Cases

Minimizing Memory Writes: Makes minimum number of swaps O(n), ideal for write-limited storage (flash memory, SSDs)
Small Datasets: Efficient for arrays with 10-50 elements where simplicity is preferred
Data Validation: Finding min/max and verifying array properties during sorting
Partially Sorted Detection: Can be enhanced to detect and handle partially sorted arrays efficiently
Educational Teaching: Excellent for teaching nested loops and algorithm basics to beginners
Hardware with Limited Writes: Embedded systems where memory operations are expensive
Stable Variant Uses: Modified versions (stable selection sort) used in hybrid algorithms
Simple Implementation Needed: Straightforward code without complex data structures required

Real-World Example

Scenario: A data logger in an embedded system needs to sort 100 sensor readings stored in flash memory with very limited write operations allowed.

Input: Sensor readings [42, 18, 65, 33, 79, 24, 51, 87, 39, 71]
Process: Repeatedly find largest unplaced element and swap it to correct position, minimizing total swaps
Output: Sorted readings [18, 24, 33, 39, 42, 51, 65, 71, 79, 87] with only 9 writes

Selection sort excels in this scenario because flash memory has limited write cycles (typically 10,000-100,000 cycles per cell). Other sorting algorithms like bubble sort could require up to n(n-1)/2 = 45 swaps, but selection sort guarantees only n-1 = 9 swaps maximum. This directly translates to longer device lifespan and reduced wear. IoT devices, data loggers, and embedded sensors often use selection sort variants to minimize memory wear while maintaining small code footprint.

Benefits: Minimum writes O(n), simple implementation, predictable swaps, ideal for write-constrained systems