- Start at beginning of the array, where index
`i = 0`. - Move through
`i`to`N`where`N`is the length of the array. - Select the min
- Swap the min with
`i`. - Increment
`i`and loop.

This visualization makes it seem like selection sorting is fast, but in reality, this algorithm iterates through all elements (gray bars) to select the smallest value.

Selection sort is not stable.

Having a runtime of always quadratic, selection sort may present itself as not the best sorting algorithm. However, this algorithm could be useful if the cost of swapping items is high.

`O(n ^{2})` comparisons,

Here's a sample implementation written in Java. Note that it extends the Sort.java class.

```
import java.util.Arrays;
public class SelectionSort extends Sort {
public static void main(String[] args) {
int[] testInt = {1,6,2,3,6,7,4,2,5};
selectionSort(testInt);
System.out.println(Arrays.toString(testInt));
}
public static void selectionSort(int[] input) {
for (int i = 0; i < input.length; i++) {
int minIndex = i;
int min = input[i];
// Iterate through array to find minimal value
for (int j = i; j < input.length; j++) {
if (input[j] < min) {
// Replace with new min if new min found
minIndex = j;
min = input[j];
}
}
// Swap with index at start of search
swap(input, minIndex, i);
}
}
}
```

Cracking the Coding Interview will tell you exactly what you need to know to land your dream job at Google, Amazon, Microsoft or any other big tech companies. Packed with over 189 interview questions and detailed solutions, this book will help you train for the classic white-board technical interview. A must have for any CS major.

$ Check price(266+ reviews)

Algorithms are the procedures that software programs use to manipulate data structures. Besides clear and simple example programs, the author includes a workshop as a small demonstration program executable on a Web browser. The programs demonstrate in graphical form what data structures look like and how they operate.

$ Check price(97+ reviews)

Ad