Top posts

Every blog post that took off on Hacker News, ranked by the votes of its best submission. 543 posts.

Systems & Performance
2025
281

Memory access is O(N^[1/3])

In computer science, we often compare the efficiency of algorithms by describing their runtime as a function of the size of the input. Sorting is O(n * log(n)), meaning that sorting a list of N items takes an amount of time proportional to the number of items multiplied by its logarithm. Matrix multiplication is…