The DSA Visualizer is designed for deep focus,
side-by-side code, and real-time execution insight.
On small screens, that level of clarity can't be preserved.
Open on a tablet (landscape) or desktop for the intended experience.
Desktop experience preview
Selection Sort works by repeatedly finding the minimum element from unsorted part and putting it at the beginning.
Sort an array of integers using Selection Sort.
Divide the array into a sorted and an unsorted region. In each pass, find the minimum element in the unsorted region and swap it with the first element of the unsorted region.
Time complexity is O(n^2). Space complexity is O(1).
Loading Interactive Visualizer...
Click "Play" or use arrow keys to step through the execution.