110. Sort an Array in Descending Order

#include <stdio.h>
#include <stdint.h>

void swp(uint8_t *arr, size_t a, size_t b){
    uint8_t temp = *(arr+a);
    *(arr+a) = *(arr+b);
    *(arr+b) = temp;
}

void bubble_sort(uint8_t *arr, uint8_t n) {
    // Your logic here
    for (size_t i=0; i<n; i++){
        for (size_t j=0; j<(n-i)-1;j++){
            uint8_t left = *(arr+j);
            uint8_t right = *(arr+j+1);
            if (left > right){
                swp(arr, j, j+1);
            }
        }
    }
}

void bubble_sort_desc(uint8_t *arr, uint8_t n) {
    // Your logic here
    for (size_t i=0; i<n; i++){
        for (size_t j=0; j<(n-i)-1;j++){
            uint8_t left = *(arr+j);
            uint8_t right = *(arr+j+1);
            if (left < right){
                swp(arr, j, j+1);
            }
        }
    }
}

int main() {
    uint8_t n;
    scanf("%hhu", &n);
    uint8_t arr[100];

    for (uint8_t i = 0; i < n; i++) {
        scanf("%hhu", &arr[i]);
    }

    bubble_sort_desc(arr, n);

    for (uint8_t i = 0; i < n; i++) {
        printf("%hhu", arr[i]);
        if(i < n-1){
            printf(" ");
        }
    }

    return 0;
}