108. Find Minimum and Maximum in an Array

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

void Selection_sort(uint8_t *arr, uint8_t n, uint8_t *min, uint8_t *max) {
    for(int i = 0; i< n-1 ; i++){
        int pos = i;
        for(int j = i+1; j < n; j++){
            if(arr[j] < arr[pos]){
                pos = j;
            }
        }
        if(pos != i){
            int tmp = arr[pos];
            arr[pos] = arr[i];
            arr[i] = tmp;
        }
    }
    *min = arr[0];
    *max = arr[n-1];
}

void bubble_sort(uint8_t *arr, uint8_t n, uint8_t *min, uint8_t *max){
    for(int i = 0 ;i < n-1; i++){
        for(int j = 0; j< n-i-1; j++){
            if(arr[j] > arr[j+1]){
                int tmp = arr[j+1];
                arr[j+1] = arr[j];
                arr[j] = tmp;
            }
        }
    }
    *min = arr[0];
    *max = arr[n-1];
}

void insert_sort(uint8_t *arr, uint8_t n, uint8_t *min, uint8_t *max){
    for(int i = 1 ; i < n ; i++){
        int pos = i-1, k = arr[i];
        while(pos >= 0 && arr[pos] > k){
            arr[pos+1] = arr[pos];
            pos--;
        }
        arr[pos+1] = k;
    }
    *min = arr[0];
    *max = arr[n-1];
}

int main() {
    uint8_t n;
    scanf("%hhu", &n);
    uint8_t arr[100];

    for (uint8_t i = 0; i < n; i++) {
        scanf("%hhu", &arr[i]);
    }

    uint8_t min_val, max_val;
    insert_sort(arr, n, &min_val, &max_val);

    printf("%hhu %hhu", min_val, max_val);
    return 0;
}