Mergesort – How fast does it work?

• merging two sorted lists with n+m elements is possible in O(n+m) steps

• the complexity of mergesort in detail: