Recursive check in the right half
return find_mth_bit ( n - 1 , len_right + 1 - ( m - len_left ) , fib ) ; } } function find_mth_bitUtil ( n , m ) { let fib = new Array ( maxN ) ; calculateFib ( fib , maxN ) ; let ans = find_mth_bit ( n , m , fib ) ; document . write ( ans + " " ) ; }