← Back to context

Comment by MauranKilom

4 years ago

The irony is that a single log computation is going to take longer than the loop. (No idea if implementing a log approximation involves loops either.)

Waiting for someone to post some fast-inverse-sqrt-esque hack to compute the logarithm. Although in Java that's probably not likely to be faster.

I wonder how fast it'd be to convert to string and count digits.

  • > I wonder how fast it'd be to convert to string and count digits.

    When you convert the number to a string you're really transforming it to a decimal format. Which is the domain where you should be solving the problem. Otherwise you're doing some sort transformation in the binary domain and then hopping to pull the answer out of a hat when you do the final convertion to decimal.

Many architectures include a logarithm instruction. Does Java use that if available? Would it make a difference?

  • Many architectures? What would they be?

    Regardless whether they contain a logarithm instruction or not, how may architectures are there these days. Outside of truly embedded computing I can only come up with 2: Intel and ARM. Counting POWER and RISCV is probably a bit of a stretch already.

    • x86 has two logarithm instructions, FYL2X and FYL2XP1.

      FYL2X takes two arguments, Y and X, and computes Y log2(X).

      FYL2XP1 takes two arguments, Y and X, and computes Y log2(X+1).

      As you note, x86 and ARM are by far the most used, and I'd guess that when it comes to Java you are more likely to be running on x86 than ARM, so I figured it was arguable to say "many" when the only one I was sure had a logarithm instruction was x86.

      1 reply →