Last active
December 16, 2015 12:19
-
-
Save vikashvverma/5433970 to your computer and use it in GitHub Desktop.
CapgeminiTechChallenge:Level1
This file contains 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
/** | |
* | |
* @author VIK VIKKU VIKASH VIKASHVVERMA | |
* @website vikash-thiswillgoaway.blogspot.in | |
*/ | |
import java.io.*; | |
public class Level1 | |
{ | |
public static int median(int[] input1,int[] input2) | |
{ | |
return getMedian(input1,input2,input1.length); | |
} | |
static int getMedian(int ar1[], int ar2[], int n) | |
{ | |
int i = 0; | |
int j = 0; | |
int count; | |
int m1 = -1, m2 = -1; | |
for(count = 0; count <= n; count++) | |
{ | |
if(i == n) | |
{ | |
m1 = m2; | |
m2 = ar2[0]; | |
break; | |
} | |
else if(j == n) | |
{ | |
m1 = m2; | |
m2 = ar1[0]; | |
break; | |
} | |
if(ar1[i] < ar2[j]) | |
{ | |
m1 = m2; | |
m2 = ar1[i]; | |
i++; | |
} | |
else | |
{ | |
m1 = m2; | |
m2 = ar2[j]; | |
j++; | |
} | |
} | |
if((m1%2==0 && m1%2==0)||(m1%2!=0&&m2%2!=0)) | |
return (m1+m2)/2; | |
return ((m1%2==0?m1:m1+1) + (m2%2==0?m2:m2+1))/2; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment