#include<bits/stdc++.h>
using namespace std;

int maximum(int a, int b);
int minimum(int a, int b);
/*double findMedianSortedArrays(int *a, int n,
                              int *b, int m)
{

    int min_index = 0, max_index = n, i, j, median;

    while (min_index <= max_index)
    {
        i = (min_index + max_index) / 2;
        j = ((n + m + 1) / 2) - i;
        if (i < n && j > 0 && b[j - 1] > a[i])
            min_index = i + 1;
        else if (i > 0 && j < m && b[j] < a[i - 1])
            max_index = i - 1;

        else
        {
            if (i == 0)
                median = b[j - 1];

            else if (j == 0)
                median = a[i - 1];
            else
                median = maximum(a[i - 1], b[j - 1]);
            break;
        }
    }

    if ((n + m) % 2 == 1)
        return (double)median;

    if (i == n)
        return (median+b[j]) / 2.0;
    if (j == m)
        return (median + a[i]) / 2.0;

    return (median + minimum(a[i], b[j])) / 2.0;
}

int maximum(int a, int b)
{
    return a > b ? a : b;
}
int minimum(int a, int b)
{
    return a < b ? a : b;
}*/

/*double findMedianSortedArrays(int *a, int n, int *b, int m, int left_val = 0, int right_val = -1) {
    if (right_val == -1) {
        right_val = n;
    }

    cout << left_val << " " << right_val << "\n";

    int i = (left_val + right_val) / 2;
    int j = (n + m + 1) / 2 - i;
    int median = 0;
    if (left_val <= right_val) {
        if (i < n && j > 0 && b[j - 1] > a[i])
            return findMedianSortedArrays(a, n, b, m, i + 1, right_val);
        else if (i > 0 && j < m && b[j] < a[i - 1])
            return findMedianSortedArrays(a, n, b, m, left_val, i - 1);

        if (i == 0)
            median = b[j - 1];

        else if (j == 0)
            median = a[i - 1];
        else
            median = max(a[i - 1], b[j - 1]);
    }
    if ((n + m) % 2 == 1)
        return (double)median;

    if (i == n)
        return (median + b[j]) / 2.0;
    if (j == m)
        return (median + a[i]) / 2.0;

    return (median + min(a[i], b[j])) / 2.0;

}*/

double findMedianSortedArrays(int *a, int n, int *b, int m, int left_pos = 0, int right_poz = -1) {
    if (right_poz == -1) {
        right_poz = n;
    }

    int i = (left_pos + right_poz) / 2;
    int j = (n + m + 1) / 2 - i;

    if (left_pos <= right_poz) {
        if (i > 0 && j < m && b[j] < a[i - 1]) {
            return findMedianSortedArrays(a, n, b, m, left_pos, i - 1);
        }
        if (j > 0 && i < n && a[i] < b[j - 1]) {
            return findMedianSortedArrays(a, n, b, m, i + 1, right_poz);
        }
    }

    double median = 0;

    if (i == 0) {
        median = b[j - 1];
    }
    else if (j == 0) {
        median = a[i - 1];
    } else {
        median = max(a[i - 1], b[j - 1]);
    }

    if ((n + m) % 2 == 1) return median;

    if (i == n) {
        return (median + b[j]) / 2.0;
    }
    if (j == m) {
        return (median + a[i]) / 2.0;
    }

    return (median + double(min(a[i], b[j]))) / 2.0;

}

class Solution {

private:

    double binSearch(vector<int>& a, vector<int>& b, int left_pos, int right_pos) {

        int n = a.size();
        int m = b.size();
        int i = (left_pos + right_pos) / 2;
        int j = (n + m + 1) / 2 - i;
        if (left_pos <= right_pos) {

            if (i > 0 && j < m && a[i - 1] > b[j]) {
                return binSearch(a, b, left_pos, i - 1);
            }
            if (j > 0 && i < n && a[i] < b[j - 1]) {
                return binSearch(a, b, i + 1, right_pos);
            }
        }

        double median = 0.0;
        if (i == 0) {
            median = b[j - 1];
        } else if (j == 0) {
            median = a[i - 1];
        } else {
            median = max(a[i - 1], b[j - 1]);
        }

        if ((n + m) % 2 == 1) return median;

        if (i == n) {
            return (median + double(b[j])) / 2.0;
        }
        if (j == m) {
            return (median + double(a[i])) / 2.0;
        }
        return (median + min(a[i], b[j])) / 2.0;
    }

public:
    double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) {
        if (nums2.size() == 0) {
            if (nums1.size() % 2 == 1) {
                return nums1[nums1.size() / 2];
            } else {
               return (nums1[nums1.size() / 2] + nums1[nums1.size() / 2 - 1]) / 2.0;
            }
        }
        if (nums1.size() == 0) {
            if (nums2.size() % 2 == 1) {
                return nums2[nums2.size() / 2];
            } else {
               return (nums2[nums2.size() / 2] + nums2[nums2.size() / 2 - 1]) / 2.0;
            }
        }
        return binSearch(nums1, nums2, 0, nums1.size());


    }
};

int main()
{
    int a[] = {1, 2, 3, 5, 6};
    int b[] = {4};
    int n = sizeof(a) / sizeof(int);
    int m = sizeof(b) / sizeof(int);

    if (n < m)
        cout << "The median is : "
             << findMedianSortedArrays(a, n, b, m);
    else
        cout << "The median is : "
             << findMedianSortedArrays(b, m, a, n);

    return 0;
}