Door in a wallYou are facing a wall that stretches infinitely in both direc-tions. There is a door in the wall, but you know neither how far away nor inwhich direction. You can see the door only when you are right next to it. De-sign an algorithm that enables you to reach the door by walking at most O(n) steps where n is the (unknown to you) number of steps between your initialposition and the door. [Par95]
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.