This is what i have so far, i need some help.

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 or C++ #include #include void mergesort(int *a, int *aux, int length) ( int i, ji, j2, j3, temp; if (length>2) if(a[0] a[1]) temp a[e] a[1]-temp; mergesort(a, aux, (length/3)); mergesort(a (length/3), aux, (length-(2*(length/3)))); mergesort(((a+(length/3))+(length-(2*(length/3)))),aux, (length/3)); for(i - e, j1-0, j2- (length/3), j3 ((length/3)+(2"(length/3)));