Find Kth Smallest and Kth Largest Element

Code

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

void sort_array(uint8_t *arr, uint8_t n) {
  
  uint8_t max = 0;
  uint8_t temp[n] = {0};
  uint8_t array_size = n;
  uint8_t *p = arr;
  
  while(array_size--){
    
    for(uint8_t i = 0; i < n ; i++){
      if(arr[i] == 0){
        continue;  
      }
      
      if((max < arr[i])){
        max = arr[i];
        p = &arr[i];
      }  
    }
    
    temp[array_size] = max;
    *p = 0;
    max = 0;
    
  }
  
  for(int i = 0; i < n; i++){
    arr[i] = temp[i];  
  }
}

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[0 + 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