문제

I have a little problem. Who knows how we can calculate the log base n with Shift_L or Shift_R?

for example: for n=2 we had this solution:

int log(int n){
int res = 0;
while((n>>=1))
    res++;
return res;
}
도움이 되었습니까?

해결책

You don't seem to want the logarithm for a base b, but the largest integer n so that n <= log_b(x). If that's the case, the following function should serve your needs:

int intlog(double base, double x) {
    return (int)(log(x) / log(base));
}

다른 팁

well this is rather a math problem instead of an actuall programming problem, if i understand your problem correctly:

log_2 (x) = log_a (x) / log_a (2) where a can be any base.

Therefore you could use the math.h's function log(double)

double res = log(x)/log(2);

라이센스 : CC-BY-SA ~와 함께 속성
제휴하지 않습니다 StackOverflow
scroll top