c - Find the minimum number in an array with recursion?

Question

int i = 0;
int min = x[i];
while ( i < n ){
    if ( x[i] < min ){
        min = x[i];
    }
    i++;
}
return min;

I've written the iterative form to find the min number of an array. But I'd like to write a function that with recursion. Please help!

Answer 1

Because this sounds like homework, here's a hint: The minimum value in an array is either the first element, or the minimum number in the rest of the array, whichever is smaller.