111. Find Kth Smallest and Kth Largest Element

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

void insertion_sort(uint8_t *arr, uint8_t n){
    // zakladamy ze 1 juz posortowany
    for (size_t i = 1; i < n; i++){
        int key = arr[i];
        int j = i-1;
        while(j >= 0 && arr[j] > key){
            arr[j+1] = arr[j];
            j--;
        }
        arr[j+1] = key;
    }
}

void sort_array(uint8_t *arr, uint8_t n) {
    // bubble sort

    for(size_t i = 0; i < n-1; i++){
        int swapped = 0;
        for(size_t j = 0; j < n-1-i; j++){
            if(arr[j] < arr[j+1]){
                int 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); // od najw do najm, arr[0] - najwiekszy
    // *smallest = arr[n-k];
    // *largest = arr[k-1];

    insertion_sort(arr, n); // od najm do najw, arr[0] - najmniejszy
    *largest = arr[n-k];
    *smallest = arr[k-1];
}

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