public int kthLargest1(int arr1[],int arr2[],int low1,int high1,int low2,int high2,int k){
        int len1 = high1-low1 +1;
        int len2 = high2 - low2+1;
        
        if(len1 == 0){
            return arr2[low2+k];
        }
        if(len2 ==0){
            return arr1[low1+k];
        }
        if(k == 0){
            return Math.min(arr1[low1], arr2[low2]);
        }
        
     
        int mid1 = len1*k/(len1 + len2);
        int mid2 = k - mid1 - 1;
        
        mid1 = low1+mid1;
        mid2 = low2 + mid2;
        
        if(arr1[mid1] > arr2[mid2]){
            k = k - mid2 + low2 -1;
            high1 = mid1;
            low2 = mid2 + 1;
        }else{
            k = k - mid1 + low1 -1;
            high2 = mid2;
            low1 = mid1+1;
        }
        return kthLargest(arr1, arr2, low1, high1, low2, high2, k);
    }
http://stackoverflow.com/questions/4686823/given-2-sorted-arrays-of-integers-find-the-nth-largest-number-in-sublinear-time
http://articles.leetcode.com/2011/01/find-k-th-smallest-element-in-union-of.html
src/com/interview/array/KthLargestInTwoSortedArray.java