Sort an Array in Ascending Order

Added swap tracking to exit early

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

void bubble_sort(uint8_t *arr, uint8_t n) {
    uint8_t i, j, noSwap, t;
    if(arr == NULL || (n <= 1 ) )    return;
    for(i = 0; i<n-1 ; i++){
        noSwap= 1;
        for(j = 0; j< n-i-1; j++){
            if(arr[j] > arr[j+1]){
                t = arr[j];
                arr[j] = arr[j+1];
                arr[j+1] = t;
                noSwap= 0;
            }
        }
        if(noSwap) break;
    }
}

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