Describe a recursive algorithm to compute the integer part of the base-two logarithm of n using only addition and integer division.
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'.