Blog post on Big-O accuracy

[Ozan Sazak]

Hi all. In last week's session I mentioned that Big-O notation is not exactly mapping to the code run time in a machine with multiple levels of memory (L1-2 in CPU core -> L3 in CPU -> RAM -> hard drive).

There's a blog post experimenting random memory access inside a linked list and claiming that the random memory access is O(√N) instead of O(1), and iterating through a linked list is O(N√N) in practice

Link to the post: https://www.ilikebigbits.com/2014_04_21_myth_of_ram_1.html

[Alperen Keles]

This warning in part 3 is pretty important IMO.