What is the most complicated part of the Mergesort algorithm?
There is no partition in Mergesort.
The two main parts of Mergesort are splitting and merging.
Splitting is easy -- just cut the list into two halves.
Merging is not hard, but it is more complicated than splitting.