The Fibonacci code above is recursive and has exponential complexity. what you will end up benchmarking by running it is more the memory (as the call stack grows exponentially) than the actual integer arithmetic. a non-recursive implementation, or something like prime factorisation would be a better test of integer performance
Statistics: Posted by virgesmith — Mon Sep 02, 2024 10:23 pm