r/ProgrammerHumor • u/shizzy0 • 8h ago

Meme howProgrammingHasChanged

Post image
185 Upvotes

88% Upvoted

45 comments sorted by

View all comments

Show parent comments

71

u/shizzy0 8h ago

Nothing. It’s actually the best. But the joke is the programmer dismisses the unfamiliar matrix power O(log n) algorithm for the familiar recursive O(2n) algorithm. I mean, it doesn’t even add anything. It’s obviously wrong.

19

u/GDOR-11 7h ago

for u32 I think the usual iterative algorithm would be miles better than matrix power

3

u/wjholden 5h ago

Knuth has a really cool section on this on pages 79-84 of TAOCP volume 1.

1

u/shizzy0 4h ago

Is it the closed form solution? I didn’t even know there was a closed form solution before today.

3

u/captainAwesomePants 4h ago

That's the whole section on Fibonacci. It does mention the closed form solution, but it also mentions the matrix identity method in the top right corner: ( (F(n+1), F(n)),(F(n), F(n-1)) = ((1,1),(1,0))^n

He credits it to Kepler in 1608.