Find Kth Smallest and Kth Largest Element

Code

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

void sort_array(uint8_t *arr, uint8_t n) {
    bool sorted = false;
    while(!sorted){
        sorted = true;
        uint8_t start = 0,end = start+1;
        while(start<=n-2 || end<=n-1){
            if(arr[start]>arr[end]){
                sorted=false;
                uint8_t tmp=arr[start];
                arr[start]=arr[end];
                arr[end]=tmp;
            }
            start++,end++;
        }
    }
}

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

Solving Approach