On: When code is suspiciously fast: adventures in dead code elimination

[jlas]

Article doesn't mention the big difference between the recursive and iterative Fibonacci solutions, which is the O(2^n) and O(n) respective time complexity.