Sign inSign in
ConceptSystems & CS

Complexity of merge sort

The time complexity of merge sort is Θ(nlog⁡n)\Theta(n \log n), derived from Θ(log⁡n)\Theta(\log n) levels of recursion each doing Θ(n)\Theta(n) merge work.
Watch it explained

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.

Merge sort1Theta notation1Tree height / bisection search1

Lecturers

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    Concepts2

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.