Find Kth Smallest and Kth Largest Element

Code

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

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

bool scrub(uint8_t *arr, uint8_t m) {
    int i;
    bool swapped = false;
    for (i = 0; i < m; i++) {
        if (arr[i] > arr[i + 1]) {
            swap(&arr[i], &arr[i + 1]);
            swapped = true;
        }
    }
    return swapped;
}

void sort_array(uint8_t *arr, uint8_t n) {
    int i, j;
    for (i = 0; i < n; i++) {
        if (!scrub(arr, (n - 1 - i)))
            break;
    }
}

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