Некоторые виды сортировок

int *sort_ascending_selection(int arr[],size_t n){
    for(int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            if(arr[i] < arr[j]){
                int buff=arr[i];
                arr[i]=arr[j];
                arr[j]=buff;
            }
        }
    }
    return arr;
}
int *sort_descending_selection(int arr[],size_t n){
    for(int i = 0; i < n; i++){
        for (int j = 0; j < n; j++){
            if(arr[i] > arr[j]){
                int buff=arr[i];
                arr[i]=arr[j];
                arr[j]=buff;
            }
        }
    }
    return arr;
}
int *sort_ascending_insert(int arr[],size_t n){
    int j;
    for (int i = 0; i < n; ++i) {
       j = i - 1;
       int k = arr[i];
       while(j >= 0 && k < arr[j]){
           arr[j-- + 1] = arr[j];
           arr[j + 1] = k;
       }
    }
    return arr;
}
int *sort_descending_insert(int arr[],size_t n){
    int j;
    for (int i = 0; i < n; ++i) {
        j = i - 1;
        int k = arr[i];
        while(j >= 0 && k > arr[j]){
            arr[j-- + 1] = arr[j];
            arr[j + 1] = k;
        }
    }
    return arr;
}
int *sort_ascending_bubble(int arr[], size_t n){
    for (int i = 0; i < n; ++i) {
        for (int j = 1; j < n; ++j) {
            if(arr[j - 1] > arr[j]){
                int buff = arr[j];
                arr[j] = arr[j - 1];
                arr[j - 1] = buff;
            }
        }
    }
    return arr;
}
int *sort_descending_bubble(int arr[], size_t n){
    for (int i = 0; i < n; ++i) {
        for (int j = 1; j < n; ++j) {
            if(arr[j - 1] < arr[j]){
                int buff = arr[j];
                arr[j] = arr[j - 1];
                arr[j - 1] = buff;
            }
        }
    }
    return arr;
}
int *sort_ascending_shaker(int arr[], int n){
    int stop,start;
    int buff;
    start = 0;
    stop = n - 1;
    for (int i = -1; start <= stop; ++i) {

        for (int j = start; j <= stop; ++j) {
            if(arr[j] < arr[j - 1]) {
                buff = arr[j];
                arr[j] = arr[j - 1];
                arr[j - 1] = buff;
            }
        }
        stop--;
        for (int j = stop; j >= start; --j) {
            if(arr[j] < arr[j - 1]) {
                buff = arr[j];
                arr[j] = arr[j - 1];
                arr[j - 1] = buff;
            }
        }
        start++;

    }
    return arr;
}
int *sort_descending_shaker(int arr[], int n){
    int stop,start;
    int buff;
    start = 1;
    stop = n - 1;
    for (int i = 0; start <= stop; ++i) {

        for (int j = start; j <= stop; ++j) {
            if(arr[j] > arr[j - 1]) {
                buff = arr[j];
                arr[j] = arr[j - 1];
                arr[j - 1] = buff;
            }
        }
        stop--;
        for (int j = stop; j >= start; --j) {
            if(arr[j] > arr[j - 1]) {
                buff = arr[j];
                arr[j] = arr[j - 1];
                arr[j - 1] = buff;
            }
        }
        start++;
    }
    return arr;
}
int *sort_ascending_shell(int arr[],int n){
    for (int dp = n/2; dp > 0; dp/=2) {
        for (int i = dp; i < n; i++) {
            for (int j = i - dp; j >= 0 && arr[j] > arr[j + dp] ; j -= dp) {
                int buff = arr[j];
                arr[j] = arr[j + dp];
                arr[j + dp] = buff;
            }
        }
    }
    return arr;
}
int *sort_descending_shell(int arr[],int n){
    for (int dp = n/2; dp > 0; dp/=2) {
        for (int i = dp; i < n; i++) {
            for (int j = i - dp; j >= 0 && arr[j] < arr[j + dp] ; j -= dp) {
                int buff = arr[j];
                arr[j] = arr[j + dp];
                arr[j + dp] = buff;
            }
        }
    }
    return arr;
}