109. Sort an Array in Ascending Order

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

void selection_sort(uint8_t *arr, uint8_t n){
    for(int i = 0; i< n-1; i++){
        int pos = i;
        for(int j = i+1; j <n; j++){
            if(arr[j] < arr[pos]){
                pos = j;
            }
        }
        if(pos != i){
            int tmp = arr[pos];
            arr[pos] = arr[i];
            arr[i] = tmp;
        }
    }
}

void bubble_sort(uint8_t *arr, uint8_t n){
    for(int i = 0; i < n-1; i++){
        for(int j = 0; j < n-i-1; j++){
            if(arr[j] > arr[j+1]){
                int tmp = arr[j+1];
                arr[j+1] = arr[j];
                arr[j] = tmp;
            }
        }
    }
}

void insert_sort(uint8_t *arr, uint8_t n){
    for(int i = 1; i<n; i++){
        int pos = i-1, k = arr[i];
        while(pos >= 0 && k < arr[pos]){
            arr[pos + 1] = arr[pos];
            pos--;
        }
        arr[pos+1] = k;
    }
}
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(arr, n);

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

    return 0;
}