Sort an Array in Ascending Order

Code

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

void swap(uint8_t *arr, uint8_t i, uint8_t j)
{
    uint8_t temp = arr[i];
    arr[i] = arr[j];
    arr[j] = temp;
}

void bubble_sort(uint8_t *arr, uint8_t n) {
    // Your logic here
    uint8_t unsorted_index= n-1;

    while(unsorted_index > 0)
    {
        for(uint8_t i=0; i<unsorted_index; i++)
        {
            if(arr[i] > arr[i+1])
            {
                swap(arr, i, i+1);
            }
        }
        unsorted_index--;
    }



}

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