leetcode media of an sort array

package com.demo.acm;

public class MedianOfTwo {

private double findKth(int[] a,int m,int[] b,int n,int k,int index1,int index2){
//System.out.println("m:"+m+" n:"+n+" k:"+k+" index1:"+index1+" index2:"+index2);
if(m>n){
return findKth(b,n,a,m,k,index2,index1);
}
if(m==0){
//System.out.println("*");
return b[index2+k-1];
}

if(k==1){
//System.out.println("-"+index1+" "+index2);
return Math.min(a[index1],b[index2]);
}

int pa=Math.min(k/2, m),pb=k-pa;
if(a[index1+pa-1]<b[index2+pb-1]){
return findKth(a,m-pa,b,n,k-pa,pa+index1,index2);
}else if(a[index1+pa-1]>b[index2+pb-1]){
return findKth(a,m,b,n-pb,k-pb,index1,index2+pb);
}else{
return a[index1+pa-1];
}
}

public double findMedianSortedArrays(int[] A, int[] B) {
int m = A.length;
int n = B.length;
int total = m + n;
//System.out.println("A:"+A.length+" B:"+B.length);
if ((total & 1) == 0) {
return (findKth(A, m, B, n, total / 2,0,0) + findKth(A, m, B, n,
total / 2 + 1,0,0)) / 2;
} else {
return findKth(A, m, B, n, total / 2 + 1,0,0);
}
}
public static void main(String[] args){
MedianOfTwo media=new MedianOfTwo();
int[] A={1};
int[] B={5,6,7};
System.out.println(media.findMedianSortedArrays(B, A));
}
}