Arrays: Sort ascending

Task: Sort this array in ascending order

for (int i = 0; i < n - 1; i++) {    int m = i;    for (int j = i + 1; j < n; j++) {        if (a[j] < a[m]) {            m = j;        }    }    swap(a, i, m);}

What you are watching

Sorting puts the values in ascending order by repeatedly finding the smallest one left and moving it to the front of what is unsorted. Each pass scans the remaining values, remembers where the smallest sat, and swaps it into place once. The green region on the left is finished and never has to be looked at again.