About this question
Hard · Algorithms & Data Structures · Quant Trader interview question · algorithms, cache-oblivious, matrix multiplication, complexity analysis
A cache-oblivious algorithm is designed to perform optimally across various cache sizes without explicitly knowing the cache parameters (size $M$ and block size $B$). Consider a cache-oblivious matrix multiplication algorithm for multiplying two $n imes n$ matrices. What is the cache complexity (number of cache misses) of this algorithm?