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 temp = arr[0];

    for(int i = 0; i + 1 < n; i++)
    {
        if(arr[i] > arr[i + 1])
        {
            temp = arr[i];

            arr[i] = arr[i + 1];
            arr[i + 1] = temp;
        }
    }

    for(int i = 0; i + 1 < n; i++)
    {
        if(arr[i] > arr[i + 1])
        {
            temp = arr[i];

            arr[i] = arr[i + 1];
            arr[i + 1] = temp;
        }
    }

    for(int i = 0; i + 1 < n; i++)
    {
        if(arr[i] > arr[i + 1])
        {
            temp = arr[i];

            arr[i] = arr[i + 1];
            arr[i + 1] = temp;
        }
    }

    for(int i = 0; i + 1 < n; i++)
    {
        if(arr[i] > arr[i + 1])
        {
            temp = arr[i];

            arr[i] = arr[i + 1];
            arr[i + 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