Sort an Array in Ascending Order

Code

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

void swap (uint8_t* a, uint8_t* b){
      int tmp=*a;
      *a=*b;
      *b=tmp;
}

void bubble_sort(uint8_t *arr, uint8_t n) {
    // Your logic here

    for (int i=0;i<n-1;i++){
        for (int j=0;j<n-1-i;j++){
            if (arr[j]>arr[j+1]){
                swap(&arr[j],&arr[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(arr, n);

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

    return 0;
}

Solving Approach