What is the intuition behind cache oblivious data structures?
I understand what the expression cache oblivious means. But I was wondering if there is any easy explanation for how data structures can be designed that can use the cache optimally, without knowing the sizes of the cache. Can you please provide such an explanation, preferably with an (easy) example? ...