Plus42 Equations, Preview Release

[John Keith]

The integer base-2 logarithm, aka the number of bits required to represent n, can be found by a simple iteration. There is a nice version in One-minute Marvels. This would be fast enough in FOCAL, and virtually instantaneous in C.

Code:


<< 0 1 ROT FOR c 1 + c STEP >>