Question: Write a mergesort function which makes three recursive calls of length n/3 on an array of size n, and then merges three sorted arrays into
Write a mergesort function which makes three recursive calls of length n/3 on an array of size n, and then merges three sorted arrays into one. void mergesort(int * a, int * aux, int length); You need a special case for arrays of length 2. The programming language is C++.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
