Find Kth Smallest and Kth Largest Element

Code

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

void sort_array(uint8_t *arr, uint8_t n) {
    /*Bubble sort*/
    for (int i=0; i<n-1; i++) {
        for (int j=0; j<n-i-1; j++) {
            if (*(arr + j) > *(arr + (j+1))) {
                /*swap*/
                uint8_t tmp = *(arr + j);
                *(arr + j) = *(arr + (j+1));
                *(arr + (j+1)) = tmp;
            }
        }
    }
}

void find_kth_elements(uint8_t *arr, uint8_t n, uint8_t k, uint8_t *smallest, uint8_t *largest) {
    /*Sort the array*/
    sort_array(arr, n);

    if (k>0 && k <=n) {
        *smallest = *(arr + (k-1));
        *largest = *(arr + (n-k));
    } else {
        *smallest = 0;
        *largest = 0;
    }
}

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;
}

Solving Approach