Find Kth Smallest and Kth Largest Element

Code

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

void sort_array(uint8_t *arr, uint8_t n) {
    uint8_t global_idx = 0;
    uint8_t min_value = arr[0];
    uint8_t tmp_idx;

    while (global_idx < n) {
        for (uint8_t idx = global_idx; idx < n; idx++) {
            if (arr[idx] <= min_value) {
                min_value = arr[idx];
                tmp_idx = idx;
            }
        }
        arr[tmp_idx] = arr[global_idx];
        arr[global_idx++] = min_value;
        min_value = arr[global_idx];
    } 
}

void find_kth_elements(uint8_t *arr, uint8_t n, uint8_t k, uint8_t *smallest, uint8_t *largest) {
    sort_array(arr, n);
    *smallest = arr[k-1];
    *largest = arr[n-k];
}

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