Arrays: Sort descending

Task: Sort this array in descending 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

Descending order is the same algorithm with one character changed. Each pass looks for the largest remaining value instead of the smallest and swaps it to the front of the unsorted region. Ascending and descending are not two techniques; they are one comparison pointing either way, which is why a sort takes a comparator.