3 ms·
Also traditionally steps of computations are counted for finding the best algorithm, but today the bottleneck for many problems is memory bandwidth. An algorith
by wongarsu 8y ago
Also traditionally steps of computations are counted for finding the best algorithm, but today the bottleneck for many problems is memory bandwidth. An algorithm that used to be best-in-class can become quite bad by just changing the ratio of CPU speed to memory speed.
- learc83 8y agoWriting game logic, I run into this all the time. Many classic algorithms were written when data locality wasn't nearly as big an issue. It's not just specific algorithms, but entire methods of problem solving. Graph traversal is so incredibly slow because of data locality.