Suppose that you have a number x that is greater than 1. Write an algorithm that computes the largest integer k such that 2k is less than or equal to x.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.