Bits of integer

[Albert Chan]

Hi, robve

We can do binary searches without the costly integer division.

lua> bisect = require'primepi'.bisect
lua> pow2 = {}
lua> for i=1,52 do pow2[i] = 2^i end
lua> function bits(n) return bisect(pow2, n) end

lua> for n = 1, 9 do print(n, bits(n)) end
1      1
2      2
3      2
4      3
5      3
6      3
7      3
8      4
9      4

It would be nice if HP71B has built-in binary search code.
Getting it right is hard.

Are you one of the 10% of programmers who can write a binary search?
Binary Search and Exclusive Upper Bounds