111. Find Kth Smallest and Kth Largest Element

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

void swp(uint8_t *arr, size_t a, size_t b){
    uint8_t temp = *(arr+a);
    *(arr+a) = *(arr+b);
    *(arr+b) = temp;
}

void sort_array(uint8_t *arr, uint8_t n) {
    // Your logic here
    for (size_t i=0; i<n; i++){
        for (size_t j=0; j<(n-i)-1;j++){
            uint8_t left = *(arr+j);
            uint8_t right = *(arr+j+1);
            if (left > right){
                swp(arr, j, j+1);
            }
        }
    }
}

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