I\'m having trouble calculating this algorithm\'s time complexity.
public static int xpto(int[] a, int[] b, int n){ if(n>0 && binarySearch(a,b[--n]