ConceptTheory & Algos
Cache-oblivious Mergesort
A sorting algorithm that recursively divides an array in half, recursively sorts each half, and merges them using interleaved scans without knowing cache parameters and .
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Cache-oblivious model1Mergesort1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.