How to remake the insertion sort function in descending order?

Question

C++ / C#

Good morning.

How can I modify this insertion sort function so that it sorts in descending order?

void insort(int* l, int* r) {
    for (int *i = l + 1; i < r; i++) {
        int* j = i;
        while (j > l && *(j - 1) > *j) {
            swap(*(j - 1), *j);
            j--;
        }
    }
}

Answer 1

Change < to > where you compare elements. Hint: you have an array passed by two int pointers. Those. the elements themselves are where you dereference some pointers (this is the *something operation).