Find Kth Smallest and Kth Largest Element

Code

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

void sort_array(uint8_t *arr, uint8_t n) {
    // Sort in ascending order
    // [2 3 5 7 10]

    for (uint8_t i = 0; i < n -1; i++) {
        uint8_t swapped = 0;
        for (uint8_t j =0; j < n -1 - i; j++) {
            if (arr[j] > arr[j+1]) {
                uint8_t tmp = arr[j];
                arr[j] = arr[j + 1];
                arr[j+1] = tmp;
                swapped = 1;
            }
        }
        if (!swapped) break;
    }
}

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