Sort without ifs

Good day. It happened so that recently I became a proud student of one of the best universities in my country. For better or worse, this is a moot point, but that's not the point. The funniest thing is that in the laboratory, the teacher is either for fun, or to remind me once again that I am very fussy about algorithms, from time to time gives tasks different from what the rest of the group gets. One of the latter, which, for me, is worthy of your attention, is to sort the array without using conditional statements (if, switch, and the like).
Since I had previously lived in the warm world of frameworks and libraries and I never had such tasks before, I was slightly surprised by such a lab. In general, despite the teacher’s numeral attempts to prompt me to make the right decision with phrases like “numbers are limited by the range from 0 to 100” and “you can use more than one array”, no solutions were found, at least for the period of the pair. In general, the couple ended up 5 minutes before it ended the sorting task was replaced by some kind of trifle, like counting the number of different digits in a number.
And as sometimes happens, instead of happily forgetting about this lab and continuing to enjoy life, from time to time I returned to the sorting task, and still came up with its solution. Actually, I want to share it with you. It came out surprisingly simple and without the use of additional arrays (therefore, most likely the task has one more solution, probably).
Here's the actual program code:

#include 
using namespace std;
int myAbs(int a){
    int oldByte = (a >> 31)& 0x1;
    return -a*(1+oldByte-1)-a*(oldByte-1);
}
int getMax(int a, int b) {
    return (a + b + myAbs(a - b)) / 2;
}
int getMin(int a, int b) {
    return (a + b - myAbs(a - b)) / 2;
}
int main() {
    int arr[] = {34, 12, 24, 65, 63, 22};
    int arraySize = (sizeof(arr) / sizeof(*arr));
    int maxPosition = 0;
    int maxElement = arr[0];
    int minValue= arr[0];
    for (int k = 0; k < arraySize; k++) {
        for (int i = k; i < arraySize; i++) {
            int newMax = getMax(maxElement, arr[i]);
            minValue = getMin(minValue, arr[i]);
            maxPosition =getMin((myAbs(newMax ^ maxElement) + 1) * (maxPosition + 1), (myAbs(newMax ^ arr[i]) + 1) * (i + 1)) -1;
            maxElement = newMax;
        }
        int buf = arr[k];
        arr[k] = maxElement;
        arr[maxPosition] = buf;
        maxElement = minValue;
    }
    for(int a:arr){
        cout<



P.S. В универе бывает даже интересно.