111. Find Kth Smallest and Kth Largest Element

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

void sort_array(uint8_t *arr, uint8_t n) {
    // Sort in ascending order
    for (int i = 1; i < n; i++) {
        int temp = arr[i];
        int j = i - 1;
            while (j >= 0 && arr[j] > temp) {
                        arr[j 
            + 1] = arr[j];  // Shift element right
                        j--;
            }
            arr[j + 1] = temp;  // Insert element
    }
}

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); //sorting array
    if(k>=1 && 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;
}