9

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;
}
425nesp
  • 6,936
  • 9
  • 50
  • 61

2 Answers2

32

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));
}
Carsten
  • 17,991
  • 4
  • 48
  • 53
8

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);

Teh Suu
  • 1,759
  • 1
  • 11
  • 7