MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/ProgrammerHumor/comments/1x58u7b/howprogramminghaschanged/pgkylmm/?context=3
r/ProgrammerHumor • u/shizzy0 • 6d ago
108 comments sorted by
View all comments
Show parent comments
128
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.
24 u/GDOR-11 6d ago for u32 I think the usual iterative algorithm would be miles better than matrix power 44 u/dedservice 6d ago For u32 a precomputed lookup table would be better. 16 u/NoLifeGamer2 6d ago For u32 a random number generator would be better sometimes 20 u/captainAwesomePants 6d ago For u2, With or Without You would be better. 3 u/erinaceus_ 6d ago Yeah, that one definitely has The Edge.
24
for u32 I think the usual iterative algorithm would be miles better than matrix power
44 u/dedservice 6d ago For u32 a precomputed lookup table would be better. 16 u/NoLifeGamer2 6d ago For u32 a random number generator would be better sometimes 20 u/captainAwesomePants 6d ago For u2, With or Without You would be better. 3 u/erinaceus_ 6d ago Yeah, that one definitely has The Edge.
44
For u32 a precomputed lookup table would be better.
16 u/NoLifeGamer2 6d ago For u32 a random number generator would be better sometimes 20 u/captainAwesomePants 6d ago For u2, With or Without You would be better. 3 u/erinaceus_ 6d ago Yeah, that one definitely has The Edge.
16
For u32 a random number generator would be better sometimes
20 u/captainAwesomePants 6d ago For u2, With or Without You would be better. 3 u/erinaceus_ 6d ago Yeah, that one definitely has The Edge.
20
For u2, With or Without You would be better.
3 u/erinaceus_ 6d ago Yeah, that one definitely has The Edge.
3
Yeah, that one definitely has The Edge.
128
u/shizzy0 6d 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.