There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).

import java.io.IOException;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.io.StreamTokenizer;
import java.io.PrintWriter;
import java.io.OutputStreamWriter;class Main {public static final boolean DEBUG = true;public BufferedReader cin;public PrintWriter cout;public StreamTokenizer tokenizer;public double findMedianSortedArrays(int[] A, int[] B) {int m = A.length;int n = B.length;if (((m + n) & 1) != 0) {return (double) findKth(A, B, (m + n) / 2, 0, m - 1, 0, n - 1);} else {return (findKth(A, B, (m + n) / 2, 0, m - 1, 0, n - 1) + findKth(A,B, (m + n) / 2 - 1, 0, m - 1, 0, n - 1)) * 0.5;}}public int findKth(int[] A, int[] B, int k, int astart, int aend,int bstart, int bend) {int aLen = aend - astart + 1;int bLen = bend - bstart + 1;if (aLen == 0)return B[bstart + k];else if (bLen == 0)return A[astart + k];if (k == 0) {return A[astart] < B[bstart] ? A[astart] : B[bstart];}int amid = (aLen * k) / (aLen + bLen);int bmid = k - amid - 1;amid = astart + amid;bmid = bstart + bmid;if (A[amid] > B[bmid]) {k = k - (bmid - bstart + 1);aend = amid;bstart = bmid + 1;} else {k = k - (amid - astart + 1);astart = amid + 1;bend = bmid;}return findKth(A, B, k, astart, aend, bstart, bend);}public void output(double ans){cout.println(ans);cout.flush();}public void init() {try {if (DEBUG) {cin = new BufferedReader(new InputStreamReader(new FileInputStream("e:\\uva_in.txt")));} else {cin = new BufferedReader(new InputStreamReader(System.in));}cout = new PrintWriter(new OutputStreamWriter(System.out));tokenizer = new StreamTokenizer(cin);} catch (Exception e) {e.printStackTrace();}}public String next() {try {tokenizer.nextToken();if (tokenizer.ttype == StreamTokenizer.TT_NUMBER) {return String.valueOf((int) tokenizer.nval);} else {return null;}} catch (Exception e) {e.printStackTrace();return null;}}public static void main(String[] args) {Main solver = new Main();solver.init();int t = Integer.parseInt(solver.next());while (t-- > 0) {int m = Integer.parseInt(solver.next());int[] a = new int[m];for (int i = 0; i < m; i++) {a[i] = Integer.parseInt(solver.next());}int n = Integer.parseInt(solver.next());int[] b = new  int[n];for (int i = 0; i < n; i++) {b[i] = Integer.parseInt(solver.next());}double ans = solver.findMedianSortedArrays(a, b);solver.output(ans);}}
}