Finding the maximum element of an array recursively

Question

Consider this code, which computes the maximum element of an array.

#include 

int maximum(int arr[], int n)
{
    if (n == 1) {
        retur         


        

Answer 1

A possible recursive solution is to compare the previous and the current element.

#include 

static int max(int a, int b) {
    return a > b ? a : b;
}
int max_array(int *p, size_t size)
{
    if (size > 1)   return max(p[size-1], max_array(p, size-1));
    else            return *p;
}