How fast is the iterative version of the Fibonacci algorithm? You’d think it is \(O(n)\), but it’s really \(O(n^{2})\), because for large integers, addition is not a constant operation. There are faster addition algorithms, but none as fast as \(O(n)\).