3 ms·
That's exactly what phk wrote about: theoretically perfect algorithms such as binary search are never practically perfect, because they never account for real l
by rakoo 8y ago
That's exactly what phk wrote about: theoretically perfect algorithms such as binary search are never practically perfect, because they never account for real life things like disk latency and memory pressure. This has lead to developers come up with inefficient softwares.