SortingEasy

Selection Sort

Repeatedly finds the minimum element from the unsorted subarray and puts it at the beginning.

Time O(n²) Space O(1)

Live loop — open the studio to scrub, add your own array, or race it in Battle Arena.

Asked in interviews at

AdobeCiscoSalesforce

Reference implementation (Python)

def selection_sort(arr):
    n = len(arr)
    for i in range(n - 1):
        min_idx = i
        for j in range(i + 1, n):
            if arr[j] < arr[min_idx]:
                min_idx = j
        arr[i], arr[min_idx] = arr[min_idx], arr[i]
    return arr

Embed this visualization

Drop a live, looping Selection Sort canvas into a blog post or course page.

<iframe src="/embed/selection-sort" width="100%" height="380" style="border:1px solid #e6e8ec;border-radius:14px" loading="lazy" title="3D algorithm visualization by CodeWithMunnaX"></iframe>

Frequently asked

What is the time and space complexity of Selection Sort?

Selection Sort runs in O(n²) time and O(1) auxiliary space.

Is the Selection Sort visualizer free?

The core 3D visualizer, Web Audio chimes and step intuition are free. A one-time ₹49 Pro Pass unlocks advanced algorithms, large custom arrays, Battle Arena and reel export.

Which companies ask Selection Sort in interviews?

Selection Sort shows up in interviews at Adobe, Cisco, Salesforce.

How does the 3D visualization of Selection Sort work?

Each array value becomes a 3D pillar whose height maps to its value. Comparisons glow amber, swaps flash red, and settled elements lock green while a floating pointer badge tracks the active index — synchronized line-by-line with the Python code.

More Sorting