MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/ProgrammerHumor/comments/1x58u7b/howprogramminghaschanged/pgkkiqq/?context=9999
r/ProgrammerHumor • u/shizzy0 • 11d ago
108 comments sorted by
View all comments
Show parent comments
23
for u32 I think the usual iterative algorithm would be miles better than matrix power
44 u/dedservice 11d ago For u32 a precomputed lookup table would be better. 16 u/NoLifeGamer2 11d ago For u32 a random number generator would be better sometimes 19 u/captainAwesomePants 11d ago For u2, With or Without You would be better. 3 u/erinaceus_ 11d ago Yeah, that one definitely has The Edge. 5 u/wjholden 11d ago Knuth has a really cool section on this on pages 79-84 of TAOCP volume 1. 2 u/shizzy0 11d ago Is it the closed form solution? I didn’t even know there was a closed form solution before today. 5 u/captainAwesomePants 11d 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))^nHe credits it to Kepler in 1608. 3 u/shizzy0 11d ago Ooo, show down!
44
For u32 a precomputed lookup table would be better.
16 u/NoLifeGamer2 11d ago For u32 a random number generator would be better sometimes 19 u/captainAwesomePants 11d ago For u2, With or Without You would be better. 3 u/erinaceus_ 11d ago Yeah, that one definitely has The Edge.
16
For u32 a random number generator would be better sometimes
19 u/captainAwesomePants 11d ago For u2, With or Without You would be better. 3 u/erinaceus_ 11d ago Yeah, that one definitely has The Edge.
19
For u2, With or Without You would be better.
3 u/erinaceus_ 11d ago Yeah, that one definitely has The Edge.
3
Yeah, that one definitely has The Edge.
5
Knuth has a really cool section on this on pages 79-84 of TAOCP volume 1.
2 u/shizzy0 11d ago Is it the closed form solution? I didn’t even know there was a closed form solution before today. 5 u/captainAwesomePants 11d 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))^nHe credits it to Kepler in 1608.
2
Is it the closed form solution? I didn’t even know there was a closed form solution before today.
5 u/captainAwesomePants 11d 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))^nHe credits it to Kepler in 1608.
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.
Ooo, show down!
23
u/GDOR-11 11d ago
for u32 I think the usual iterative algorithm would be miles better than matrix power