阅读背景:

如何快速找到一个二进制对数?(O(1)在最好的情况下)

来源:互联网 

Is there any very fast method to find a binary logarithm of an integer number? For example, given a number x=52656145834278593348959013841835216159447547700274555627155488768 such algorithm must find y=log(x,2) which is 215. x is always a power of 2.Is there any very fast method to find a binary




你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到: