Mergesort Analysis

• Storage complexity is 2n plus O(log n) for the call stack.

  • This is not an “in-place” sorting algorithm.

• Time complexity is O(n log n).

  • Recurrence describes the running time

2 recursive calls

Time to merge and copy.

Previous slide

Next slide

Back to first slide

View graphic version