Homework (Divide & conquer)

Implement mergesort that instead of splitting the sequence to two equal parts splits it into k parts. Analyse its time complexity (for every given k>2). Will it run faster than usual quicksort?