Selection Sort .comparison

Iterative selection of the minimum element to build a sorted sub-array

Speed: 400ms

Scanner ( j )

Known Min

Sorted Block

Scanner [i , j]

— : —

Current Minimum

—

Total Swaps

Max -1 allowed

Step: 1 / 0

0% Complete

SELECTION_SORT.JS

function selectionSort(array) {
    let n = array.length;
    for (let i = 0; i < n - 1; i++) {
        // Assume the first element in unsorted subarray is min
        let minIdx = i;
        for (let j = i + 1; j < n; j++) {
            // Update minimum index if smaller element found
            if (array[j] < array[minIdx]) {
                minIdx = j;
            }
        }
        // Swap only if a smaller element was found
        if (minIdx !== i) {
            let temp = array[minIdx];
            array[minIdx] = array[i];
            array[i] = temp;
        }
    }
    return array;
}

Complexity AnalysisO(N²)

Time: O(N²)Space: O(1)

Pro Tip

Unlike Bubble Sort which actively mutates the array constantly via swaps, Selection Sort only makes **one** swap per outer loop pass. This minimizes expensive write operations to Memory!

Algorithm Status

Initializing selection sort...