Concept
Selection sort is a comparison sorting algorithm that repeatedly selects the smallest remaining element and moves it into place.
Computer Science DSA Lab
Selection Sort Visualizer for Interactive DSA Practice
Watch selection sort scan the unsorted region, find the minimum value, and place it into the next sorted position. Learn the concept, operation flow, complexity, and real-world use cases through a focused OpenLabs interactive visualizer.
DSA Visualizer
Minimum selection sorting
Best: O(n^2), Average: O(n^2), Worst: O(n^2), Space: O(1)
Step 1
Scan minimum
Step 2
Select value
Step 3
Swap into place
Step 4
Grow sorted region
Operation flow
Each pass finds the minimum value in the unsorted region and swaps it with the first unsorted element.
Complexity
Best: O(n^2), Average: O(n^2), Worst: O(n^2), Space: O(1)
Visualization
Watch each operation update the structure or algorithm state step by step.
Learn by visualizing
Understand Selection Sort through step-by-step interaction
Each pass finds the minimum value in the unsorted region and swaps it with the first unsorted element. The lab makes every state change visible, helping students connect DSA theory with practical algorithm behavior.
Understand minimum selection from the unsorted region.
Visualize comparisons and swaps for each pass.
Learn why selection sort always performs many comparisons.
Compare selection sort with bubble and insertion sort.
Where this concept is used
- Introductory sorting lessons
- Small arrays
- Low swap-count scenarios
- Algorithm tracing practice
How the interactive lab works
Open the Selection Sort lab, run the available operation controls, and watch the visual state update immediately. Use the animation to trace the operation order, compare complexity, and verify your understanding.
Curriculum Continuity
View All DSA LabsExplore Related DSA Visualizers
Graph AlgorithmDijkstra: O((V + E) log V)
Graph Algorithms & Network Flow
Construct custom weighted networks, trace Dijkstra shortest paths, compute Kruskal Minimum Spanning Trees, test 2-colorability, and simulate Ford-Fulkerson maximum network flow step by step.
Data StructureSearch: O(n)
Linked List
Explore linked lists by watching nodes connect through pointers while insertion, deletion, and traversal operations update the structure.
Data StructureEnqueue: O(1)
Queue
Understand queue behavior by adding items at the rear and removing them from the front in first-in, first-out order.
Data StructurePush: O(1)
Stack
Explore stack operations by pushing values on top, popping the latest value, and seeing last-in, first-out behavior clearly.
Sorting AlgorithmBest: O(n)
Bubble Sort
Watch bubble sort compare neighboring values, swap them when needed, and move larger values toward the end of the array.
Sorting AlgorithmBest: O(n log n)
Heap Sort
Explore heap sort by building a max heap, moving the root to the sorted region, and heapifying the remaining array.
Selection Sort FAQs
What is selection sort?
Selection sort repeatedly finds the smallest element in the unsorted part and swaps it into the sorted part.
What is selection sort time complexity?
Selection sort is O(n^2) in best, average, and worst cases.
Does selection sort make many swaps?
No. Selection sort makes at most one swap per pass, but it still makes many comparisons.
Ready to practice Selection Sort?
Launch the visualizer, trace each step, and build confidence with data structures and algorithms through hands-on learning.