Recursive_Small_In_Vector

#include <stdio.h>

int menor(int *vet, int n){
    if(n == 1) return vet[0];
    else{
        int x = menor(vet, n-1);
        if(x < vet[n-1]) return x;
        else return (vet[n-1]);
    }
}

int maior(int *vet, int n){
    if(n == 1) return vet[0];
    else{
        int x = maior(vet, n-1);
        if(x > vet[n-1]) return x;
        else return (vet[n-1]);
    }
}


int main(void) {

    int n;
    n = 4;
    
    int i[n];
    i[0] = 5;
    i[1] = 7;
    i[2] = 2;
    i[3] = 9;
    
    printf("Menor: %d\n",menor(i,n));
    printf("Maior: %d",maior(i,n));
    
    
    return 0;
}