Median of Two Sorted Arrays

 public double findMedianSortedArrays(int a[], int b[]) {
        // Start typing your Java solution below
        // DO NOT write main() function
        int length = a.length + b.length;
        int mid = length / 2;
        boolean isEven = length % 2 == 0;
        int i = 0;
        int j = 0;
        int curValue = Integer.MAX_VALUE;
        int preValue = Integer.MAX_VALUE;
        while(i + j < mid + 1){
        	preValue = curValue;
            if(i >= a.length){
                curValue = b[j];
                j++;
            }else if(j >= b.length){
                curValue = a[i];
                i++;
            }else{
               if(a[i] <= b[j]){
	                curValue = a[i];
	                i++;
	            }else if(a[i] > b[j]){
	                curValue = b[j];
	                j++;
	            }
            }
        }
        
        if(isEven){
            return (double)(preValue + curValue)/2;
        }else{
            return curValue;
        }
    }