Lecture Design and Analysis of Algorithms - Lecture 24: Cache-oblivious algorithms II. The following will be discussed in this chapter: Why LRU block replacement strategy? Binary mergesort, cache-oblivious sorting, priority queues, sorting. | Lecture Design and Analysis of Algorithms - Lecture 24: Cache-oblivious algorithms II