Find Kth Smallest and Kth Largest Element

Code

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

void swap(uint8_t *arr,int a,int b){
    int temp=arr[a];
    arr[a]=arr[b];
    arr[b]=temp;
}
void sort_array(uint8_t *arr, uint8_t n) {
    for(int i=0;i<n-1;i++){
        for(int j=i+1;j<n;j++){
            if(arr[i]>arr[j]) swap(arr,i,j);
        }
    }
}

void find_kth_elements(uint8_t *arr, uint8_t n, uint8_t k, uint8_t *smallest, uint8_t *largest) {
    sort_array(arr,n);
    for(int i=0,j=n-1;i<n;i++,j--){
        if(i==k-1){
            *smallest=arr[i];
            *largest=arr[j];
        }
    }
}

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