← All examples

Selection sort

Java Algorithms

selection sort

Flowchart (ISO 5807)

YesNoStartInput ai = 0, a.length - 1 - 1, 1min = ij = i + 1, a.length - 1, 1a[j] < a[min]min = jt = a[min]a[min] = a[i]a[i] = tEndFigure 1 — Sort.selection

Source code

class Sort {
    static void selection(int[] a) {
        for (int i = 0; i < a.length - 1; i++) {
            int min = i;
            for (int j = i + 1; j < a.length; j++) {
                if (a[j] < a[min]) min = j;
            }
            int t = a[min];
            a[min] = a[i];
            a[i] = t;
        }
    }
}