3 ms·
The mindfuck when you realize cache locality can make an O(log n) algo faster than an O(1) algo, and the big-O analysis only really matters for extremely large
by shrimp_emoji 4y ago
The mindfuck when you realize cache locality can make an O(log n) algo faster than an O(1) algo, and the big-O analysis only really matters for extremely large data sets. :D