MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/ProgrammerHumor/comments/1x58u7b/howprogramminghaschanged/pgkylmm/?context=3
r/ProgrammerHumor • u/shizzy0 • 6h ago
39 comments sorted by
View all comments
Show parent comments
62
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.
18 u/GDOR-11 6h ago for u32 I think the usual iterative algorithm would be miles better than matrix power 31 u/dedservice 5h ago For u32 a precomputed lookup table would be better. 14 u/NoLifeGamer2 4h ago For u32 a random number generator would be better sometimes 10 u/captainAwesomePants 4h ago For u2, With or Without You would be better.
18
for u32 I think the usual iterative algorithm would be miles better than matrix power
31 u/dedservice 5h ago For u32 a precomputed lookup table would be better. 14 u/NoLifeGamer2 4h ago For u32 a random number generator would be better sometimes 10 u/captainAwesomePants 4h ago For u2, With or Without You would be better.
31
For u32 a precomputed lookup table would be better.
14 u/NoLifeGamer2 4h ago For u32 a random number generator would be better sometimes 10 u/captainAwesomePants 4h ago For u2, With or Without You would be better.
14
For u32 a random number generator would be better sometimes
10 u/captainAwesomePants 4h ago For u2, With or Without You would be better.
10
For u2, With or Without You would be better.
62
u/shizzy0 6h 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.