# The Myth of RAM, part II

In the first article I measured random memory accesses and found them to roughly follow O(√N). But why? To answer that, we need to learn a bit about black holes and quantum physics!

Read MoreIn the first article I measured random memory accesses and found them to roughly follow O(√N). But why? To answer that, we need to learn a bit about black holes and quantum physics!

Read MoreIf you have studied computing science, then you know how to do complexity analysis. You’ll know that iterating through a linked list is *O(N)*, binary search is *O(log(N))* and a hash table lookup is *O(1)*. What if I told you that all of the above is wrong? What if I told you that iterating through a linked list is actually *O(N√N)* and binary searches as well as hash lookups both are *O(√N)*?