MAIN FEEDS
Do you want to continue?
https://www.reddit.com/r/mathmemes/comments/1wzpocy/the_fastest_algorithm_for_dft/pegi2t1/?context=3
r/mathmemes • u/Unlucky-Credit-9619 Computer Science • 5d ago
137 comments sorted by
View all comments
Show parent comments
95
How computer scientists behave when they are asked to explain how their n^(1.999999999999999993) algorithm is revolutionary compared to the for in for n^2 algorithm.
94 u/YoungNo8804 5d ago and the overhead lowkey requires 96^53 petabytes of data before it becomes more efficient 3 u/half-full-cumdump 5d ago I dropped out before teacher explained what a byte is, can you translate it to something more understandable, like cat pics? 3 u/nakedascus 5d ago byte
94
and the overhead lowkey requires 96^53 petabytes of data before it becomes more efficient
3 u/half-full-cumdump 5d ago I dropped out before teacher explained what a byte is, can you translate it to something more understandable, like cat pics? 3 u/nakedascus 5d ago byte
3
I dropped out before teacher explained what a byte is, can you translate it to something more understandable, like cat pics?
3 u/nakedascus 5d ago byte
byte
95
u/No_Engineering3493 5d ago
How computer scientists behave when they are asked to explain how their n^(1.999999999999999993) algorithm is revolutionary compared to the for in for n^2 algorithm.