Find Kth Smallest and Kth Largest Element

Code

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

void sort_array(uint8_t *arr, uint8_t n) {
    for(int i = 0; i < n; i++){
        for(int j = i + 1; j < n; j++){
            if(*(arr + j) < *(arr + i)) {
                uint8_t temp = *(arr+i);
                *(arr + i) = *(arr + j);
                *(arr + j) = temp;
            }
        }
    }
}

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);
    // k = k%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;
}
/*

Input: n = 4, arr = [8 1 9 6], k = 1
                     1 6 8 9
Output: 1 9

Input: n = 5, arr = [10 3 5 2 7], k = 2
                     2 3 5 7 10
Output: 3 7

Input: n = 3, arr = [10 20 30], k = 3
                     10 20 30
Output: 30 10

n = 6 arr = 2 4 6 8 10 12 k = 4
Output: 8 6
*/

Solving Approach