ConceptSystems & CS
Merge sort
A sorting algorithm that recursively divides a list into two halves, sorts them, and then merges the sorted halves.
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.
Recursion5Sorting3Sorting algorithms2Array1Asymptotic complexity1Divide and conquer1Divide-and-conquer paradigm1Merge step1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
5Each in their own terms, from the easiest level.
Ana Bell
A divide-and-conquer sorting algorithm that recursively splits a list in half and then merges the resulting sorted sublists in a smart way.Srini Devadas
A divide-and-conquer sorting algorithm that recursively splits an array into halves, sorts them, and merges the sorted halves.Julian Shun
A sorting algorithm that recursively divides the input into two halves, sorts them, and merges the results.David J. Malan
A sorting algorithm that divides a list of numbers in half, sorts each half recursively, and then merges the sorted halves together.
Lectures that assume it
5Connections
19The lectures that define it or assume it, and the concepts next to it.