| ??? 01/10/08 18:49 Read: times |
#149266 - Why not ? Responding to: ???'s previous message |
haven't tested for all possible 4290000000+ inputs,
Why not ? :) The nice thing about a 32 bit integer logarithm algorithm is that you can actually test it for every possible input value. On a PC, that's a matter of a few minutes at most. |
| Topic | Author | Date |
| Integer square root algorithm performance | 01/01/70 00:00 | |
| How many cycles per iteration ? | 01/01/70 00:00 | |
| The edge of chaos | 01/01/70 00:00 | |
| Yes, but he can simulate the performance... | 01/01/70 00:00 | |
| Convergence | 01/01/70 00:00 | |
| Why not ? | 01/01/70 00:00 | |
Sample testing | 01/01/70 00:00 | |
| some links | 01/01/70 00:00 |