int maxArr(int arr[], int n)
{
    if (n == 1)
    {
        return arr[0];
    }
    else
    {
        int left = maxArr(arr, n / 2);
        int right = maxArr(arr + n / 2, n / 2);
        return (left > right ? left : right;)
    }
}