Re:The Aggregate Magic Algorithms (2015)
by raverbashing on Monday June 19, 2017 @10:30AM
(#14587213)
These "filler" expressions are typical in mathematical demonstrations (as an indication that step won't be explained). But sometimes it's not obvious
> Clearly, floor of base 2 log of x is (WORDBITS-lzc(x)).
Yes. Because the 1st bit indicates the MSB of the number and the way binary works
If you have only one bit set, then WORDBITS-lzc(x) is log2(x). If you have less significant bits enabled that won't be enough to bump the floor to the next number
> Clearly, floor of base 2 log of x is (WORDBITS-lzc(x)).
Yes. Because the 1st bit indicates the MSB of the number and the way binary works
If you have only one bit set, then WORDBITS-lzc(x) is log2(x). If you have less significant bits enabled that won't be enough to bump the floor to the next number