3 ms·
CS professors always bring up the tape example, but it's true for any medium where linear access is faster than random, which becomes applicable as you move dow
by andrewf 15y ago
CS professors always bring up the tape example, but it's true for any medium where linear access is faster than random, which becomes applicable as you move down from L1 cache -> memory -> local disk -> network.
Linked lists, too :)
- leif 15y agoof course, only years later would I understand the proof of why: M/B-way merge sort is optimal in external memory