Skip to main content

How to Implement Selection Sort in Batch Script

Sorting data is a fundamental requirement for organizing reports, managing inventories, or prioritizing tasks. While Bubble Sort is well-known, Selection Sort is another classic algorithm that works by repeatedly finding the minimum element from the unsorted part and putting it at the beginning. It is generally more efficient than Bubble Sort because it performs fewer "Swaps" in memory.

In this guide, we will demonstrate how to implement the Selection Sort algorithm using nested loops in a Batch script.

  1. Assume the first element is the "Minimum."
  2. Iterate through the rest of the list.
  3. If you find an element smaller than the current minimum, update your minIndex pointer.
  4. After finishing the pass, swap the element at minIndex with the first element.
  5. Repeat for the second element, third, etc.
note

Selection Sort has a time complexity of O(n²), but it performs at most n−1 swaps compared to Bubble Sort's potentially O(n²) swaps. This makes it preferable when the cost of moving data is high relative to the cost of comparisons.

Implementation Script​

@echo off
setlocal enabledelayedexpansion

:: 1. Define the Array
set "size=5"
set "ARR_1=89"
set "ARR_2=12"
set "ARR_3=45"
set "ARR_4=3"
set "ARR_5=34"

echo Unsorted List: !ARR_1! !ARR_2! !ARR_3! !ARR_4! !ARR_5!

:: 2. Selection Sort Algorithm
for /L %%i in (1,1,%size%) do (
    set "minIndex=%%i"
    set /a "start=%%i + 1"

    rem Inner loop: Find the smallest remaining element
    rem (for /L ranges evaluate at parse-time, so we iterate all and filter via if)
    for /L %%j in (2,1,%size%) do (
        if %%j GEQ !start! (
            set "valJ=!ARR_%%j!"
            rem Use a for loop to convert the delayed-expansion variable
            rem into a for variable so it can be nested inside !ARR_...!
            for %%m in (!minIndex!) do set "valMin=!ARR_%%m!"

            if !valJ! LSS !valMin! (
                set "minIndex=%%j"
            )
        )
    )

    rem Swap the minimum found with the current position (%%i)
    if !minIndex! NEQ %%i (
        set "temp=!ARR_%%i!"
        for %%m in (!minIndex!) do (
            set "ARR_%%i=!ARR_%%m!"
            set "ARR_%%m=!temp!"
        )
    )
)

echo Sorted List:   !ARR_1! !ARR_2! !ARR_3! !ARR_4! !ARR_5!

endlocal
pause

Why Use Selection Sort?​

  1. Memory Efficiency: Unlike Bubble Sort, which swaps elements constantly, Selection Sort only performs one swap per pass. This is beneficial if your "Swaps" are expensive operations (like moving files on a disk).
  2. Predictable Performance: It always performs the same number of comparisons, making its execution time consistent regardless of how unsorted the initial list is.
  3. Algorithmic Training: Understanding how to manage indexes and pointers is a vital skill for building advanced, logic-heavy automation tools.

Important Limitations​

warning

Batch arithmetic (set /a) and comparisons (if LSS, if GTR) only work with signed 32-bit integers (approximately ±2.1 billion). Decimal values and numbers exceeding this range cannot be sorted with this method. For such cases, use the PowerShell bridge.

  1. Complexity: Like Bubble Sort, Selection Sort is O(n²). It is inefficient for massive datasets (thousands of items). For large lists, use the native sort command with zero-padding.
  2. No Decimals: Batch arithmetic is restricted to whole numbers (integers).
  3. 32-Bit Limit: Comparisons fail on numbers larger than ~2.1 billion.

Best Practices​

  1. Array Cleanup: Use a specific prefix (like ARR_) for your variables so you can identify and clear the entire array by looping through the indices after processing is complete.
  2. Fixed-Width Padding: If you are sorting numbers from a file, consider padding them with zeros (001, 002) and using the native Windows sort command; it is significantly faster than any loop-based algorithm implemented in Batch.
tip

To sort in descending order, change if !valJ! LSS !valMin! to if !valJ! GTR !valMin!. This causes the algorithm to find the maximum element on each pass instead of the minimum, placing the largest values at the front.

Conclusion​

Implementing Selection Sort provides a more refined way to manage data organization in your scripts. By minimizing the number of data-swapping operations, you create scripts that are not only mathematically accurate but also optimized for system performance. This level of control is essential for building professional, high-quality automation tools that handle inventories and logs with precision.

Table of Contents