The Six Most Common Species Of Code

Previous discussion: https://news.ycombinator.com/item?id=6711192

False. Math phd would probably write O(log n) based on either multiplying [[1,0], [1,1]] matrix or compute it directly for smaller numbers and return the rounded power of golden ratio for higher numbers.

Notice that for big enough numbers psi becomes insignificant enough, so that we can only use phi.

Everybody (except the Math PhD) writes the naive O(2^n) solution? Fat chance...

That is preposterous! At a hackathon they would probably just return 10 or something.

    int fib(int val) { return 10; } // todo: implement me

my code is the cat code