> Sorting costs some time, but in return, removes cache misses from the for loop entirely. Mmm. Can someone explain this? To avoid n cache misses in the for lo

> Sorting costs some time, but in return, removes cache misses from the for loop entirely. Mmm. Can someone explain this? To avoid n cache misses in the for loop, we accept nlog(n) cache misses for sorting?