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
7 months ago
382,602 views
0 shares
algorithm-memes, complexity-theory-memes, theoretical-cs-memes, big-o-notation-memes, p-vs-np-memes | ProgrammerHumor.io
More Like This
When The "Optimized" Code Runs Slower Than The Original
1 year ago
277.5K views
1 shares
It Won’T Get Any More Compact.
1 year ago
373.7K views
0 shares
Every AI Secretly Wants To Write Code
5 months ago
861.1K views
0 shares
Nothing Works And We Don't Know Why
1 year ago
447.7K views
0 shares
The Deadlock
1 month ago
54.8M views
0 shares
MEKASS Ergonomic Wrist Rest for Keyboard and Mouse, Soft Memory Foam Keyboard Wrist Rest Set with Non-Slip Silicone Base, Easy Typing, Pain Relief, Comfort for Office, Work, Gaming (Classic Black)
Affiliate
Desk Accessories
MEKASS
The Unholy Alliance Of Unicode And Physics
1 year ago
286.3K views
0 shares
Loading more content...
AI
AWS
Agile
Algorithms
Android
Apple
Bash
C++