Find Kth Smallest and Kth Largest Element

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

void sort_array(uint8_t *arr, uint8_t n) {
    // Sort in ascending order
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n-1; j++)
        {
            int var = *(arr+j);
            if(var > *(arr+(j+1)))
            {
                // printf("var=%u *(arr+(j+1))=%u \n",var,*(arr+(j+1)));
                *(arr+j) = *(arr+(j+1));
                *(arr+(j+1))= var;                
                // printf("*(arr+j)=%u *(arr+(j+1))=%u \n",*(arr+j),*(arr+(j+1)));
            }
        }        
    }
    // for(int k=0; k<n; k++)
    // {
    //     printf("%d",*(arr+k));
    // }
    // printf("\n");
}

void find_kth_elements(uint8_t *arr, uint8_t n, uint8_t k, uint8_t *smallest, uint8_t *largest) {
    // Your logic here
    sort_array(arr,n);
    *smallest = *(arr+(k-1));
    *largest = *(arr+((n-1)-(k-1)));
}

int main() {
    uint8_t n, k;
    scanf("%hhu", &n);
    uint8_t arr[100];
    
    for (uint8_t i = 0; i < n; i++) {
        scanf("%hhu", &arr[i]);
    }

    scanf("%hhu", &k);

    uint8_t smallest, largest;
    find_kth_elements(arr, n, k, &smallest, &largest);

    printf("%hhu %hhu", smallest, largest);
    return 0;
}