> In the Fibonacci example given, a simple array would have much, much better performance. When I looked at the output of the hash function in Python for integ

> In the Fibonacci example given, a simple array would have much, much better performance. When I looked at the output of the hash function in Python for integers a few weeks ago it looked like the identity function was being used. You'll still have greater complexity than an array, but I'm not sure how much greater.