(int len, int k)
| 5 | return recur(len,k); |
| 6 | } |
| 7 | public char recur(int len, int k){ |
| 8 | //base case |
| 9 | if(len == 1){ |
| 10 | return '0'; |
| 11 | } |
| 12 | int half = len/2; |
| 13 | int middle = half+1; |
| 14 | System.out.println("len -> "+ len + " ,middle-> " + middle + " ,k-> "+ k); |
| 15 | if(k==middle){ |
| 16 | return '1'; |
| 17 | }else if(k<middle){ //left |
| 18 | return recur(half,k); |
| 19 | }else { //right |
| 20 | char ans = recur(half, 1 + len - k); |
| 21 | return (ans == '0')?'1':'0'; |
| 22 | } |
| 23 | } |
| 24 | } |