Created
October 13, 2016 04:59
-
-
Save kartikkukreja/3ac5b926d12457938a6c4397b9cdb17c to your computer and use it in GitHub Desktop.
median of two sorted arrays example
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
int getOrderStatistic(const vector<int>& A, int as, int ae, const vector<int>& B, int bs, int be, int k) { | |
int n = ae - as + 1, m = be - bs + 1; | |
if (n > m) | |
return getOrderStatistic(B, bs, be, A, as, ae, k); | |
if (n <= 0) | |
return B[bs + k - 1]; | |
if (k == 1) | |
return min(A[as], B[bs]); | |
int pa = min(k/2, n), pb = k - pa; | |
return A[as+pa-1] <= B[bs+pb-1] | |
? getOrderStatistic(A, as+pa, ae, B, bs, bs+pb-1, k-pa) | |
: getOrderStatistic(A, as, as+pa-1, B, bs+pb, be, k-pb); | |
} | |
double findMedianSortedArrays(const vector<int> &A, const vector<int> &B) { | |
int n = A.size(), m = B.size(); | |
return (n + m) % 2 != 0 | |
? getOrderStatistic(A, 0, n-1, B, 0, m-1, (n+m)/2 + 1) | |
: (getOrderStatistic(A, 0, n-1, B, 0, m-1, (n+m)/2) + getOrderStatistic(A, 0, n-1, B, 0, m-1, (n+m)/2 + 1)) / 2.0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment