tag

#selection-sort

4 pages tagged

Programming › Algorithm Cookbook › Chapter 6. Sorting ›

6.2 Selection Sort

6.2 Selection Sort Selection sort is the simplest sorting algorithm built around a clear global choice. At each step, it finds the smallest element in the unsorted suffix and moves that element into the next output position. The sorted prefix grows by one element per pass. Problem You have an array A[0..n-1] . You want to sort it in nondecreasing order using only constant extra memory and a small number...
algorithms sorting selection-sort May 4, 2026
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Stable Selection Sort

Stable Selection Sort Stable selection sort modifies selection sort to preserve the relative order of equal elements. Instead of swapping the minimum element into position, it removes the minimum and shifts the intervening elements right by one position. This ensures stability at the cost of additional data movement. Problem Given a sequence $A$ of length $n$, reorder it such that $$ A[0] \le A[1] \le \cdots \le A[n-1] $$ and...
algorithms sorting selection-sort stable
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Double Selection Sort

Double Selection Sort Double selection sort improves selection sort by selecting both the minimum and maximum elements in each pass. It places the minimum at the beginning and the maximum at the end, reducing the number of passes by roughly half. Problem Given a sequence $A$ of length $n$, reorder it such that $$ A[0] \le A[1] \le \cdots \le A[n-1] $$ Algorithm Maintain two boundaries, left and right. In...
algorithms sorting selection-sort bidirectional
Wiki › Algorithms › 01. Searching and Sorting › 6. Elementary Sorting ›

Selection Sort

Selection Sort Selection sort divides the array into a sorted prefix and an unsorted suffix. At each step, it selects the smallest element from the unsorted portion and swaps it into the next position of the sorted prefix. Unlike bubble-based methods, it performs a fixed number of swaps, which can be useful when swaps are expensive. Problem Given a sequence $A$ of length $n$, reorder it such that $$ A[0]...
algorithms sorting selection-sort arrays