Homework (Divide & conquer)
Conditions d'achèvement
Ouvert le : mercredi 22 avril 2020, 00:00
À remettre : mercredi 29 avril 2020, 00:00
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?