Theoretical computer scientists really out here creating algorithms with time complexity that looks like someone smashed their keyboard while having a seizure—O(n72649lg72(n))—and then celebrating like they just won the lottery because "hey, at least it's polynomial time!" The P vs NP problem has these folks so desperate for wins that proving something is solvable in polynomial time (even if that polynomial makes the heat death of the universe look quick) is cause for celebration. Sure, your algorithm would take longer than the age of the universe to sort a deck of cards, but technically it's in P, so break out the champagne! It's like saying "I can walk to Mars" and when everyone looks at you skeptically, you add "well, it's theoretically possible!" Meanwhile, us practical programmers are over here optimizing O(n log n) to O(n) and actually shipping products.
For Theoretical Computer Scientists
6 months ago
368,560 views
0 shares
algorithm-memes, complexity-theory-memes, theoretical-cs-memes, big-o-notation-memes, p-vs-np-memes | ProgrammerHumor.io
More Like This
I Wish For Int Max Wishes
1 year ago
291.5K views
2 shares
This Is How Your Insurance Claims Are Decided
1 year ago
437.6K views
1 shares
It's Inevitable: The Great CS Degree Desert Expedition
1 year ago
379.1K views
0 shares
Scan This QR Code Inception
1 year ago
384.7K views
0 shares
When Array Indexing Destroys Your Social Life
1 year ago
257.4K views
0 shares
The Infinite Recursion Nightmare
1 year ago
369.9K views
0 shares
Loading more content...
AI
AWS
Agile
Algorithms
Android
Apple
Bash
C++