ConceptTheory & Algos
-way mergesort
A sorting algorithm that recursively divides the problem of size N into subproblems and merges them using parallel scans.
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.
External-memory model1Mergesort1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.