Mergesort
•
Which is the same as 3*N-2
m
.
•
Using the BIG O approach, this breaks down
to O(N) operations at each level of recursion.
•
Because there are either log
2
N or 1+log
2
N
levels, mergesort altogether has a worst and
average case efficiency of O(N*log
2
N)
