recursion_on_arrays

#include<bits/stdc++.h>
using namespace std;
int recursivesum(int currind, int end, int a[])
{
    if (currind == end) return 0;
    int sum = a[currind] + recursivesum(currind + 1, end, a);
    return sum;
}

int recursivemax(int currind, int end, int a[])
{
    if (currind == end) return -INT_MAX;
    int mx = max(a[currind], recursivemax(currind + 1, end, a));
    return mx;
}


int recursivemin(int currind, int end, int a[])
{
    if (currind == end) return INT_MAX;
    int mn = min(a[currind], recursivemin(currind + 1, end, a));
    return mn;
}


int main()
{
    int n; cin >> n;
    int a[n + 1];
    for (int i = 1; i <= n; i++) cin >> a[i];


    int sum = recursivesum(1, n + 1, a);
    cout << "Sum-> " << sum << endl;


    int mx = recursivemax(1, n + 1, a);
    cout << "Max-> " << mx << endl;


    int mn = recursivemin(1, n + 1, a);
    cout << "Min-> " << mn << endl;


    return 0;
}