Sort an Array in Ascending Order

Code

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

void bubble_sort(uint8_t *arr, uint8_t n) {
    // Your logic here
    /*int i;
    for(i=1;i<n;i++){
        uint8_t temp = *(arr+i);
        int j = i-1;
        while(j>=0 && *(arr+j)>temp){
            *(arr+j+1) = *(arr+j);
            j--;
        }
        arr[j+1] = temp;
    }*/

    for(uint8_t i=0;i<n-1;i++){
        for(uint8_t j=0;j<n-1-i;j++){
            if(*(arr+j)>*(arr+j+1)){
                uint8_t temp = *(arr+j);
                *(arr+j) = *(arr+j+1);
                *(arr+j+1) = temp;
            }
        }
    }
}

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;
}

Solving Approach