111. Find Kth Smallest and Kth Largest Element

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

void swap(uint8_t *a, uint8_t *b){
    uint8_t temp = *a;
    *a = *b;
    *b = temp; 
}

void sort_array(uint8_t *arr, uint8_t n) {
    // Sort in ascending order
    if(n<=1)
        return;
    for(int i=1;i<n;i++){
        if(arr[i-1]>arr[i]){
            swap(&arr[i-1],&arr[i]);
        }
    }
    sort_array(arr,n-1);
}

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