Assignment 3


Write two functions with the calling sequence

   int dumsort(double *a, int n, int *ind),

   int dumsort_rec(double *a, int n, int *ind),

sorting in the increasing order an array *a of double precision
numbers via the Mergesort.  The function dumsort_rec should use the
recursion, and the function dumsort should not. Both functions should
be applicable to long arrays, i.e. should perform their memory
management properly; the length of the input array is not assumed 
to be a power of tw0.


On input, *a is the pointer to the array to be sorted, and n is the
number of elements in *a. On output, *a contains the sorted array,
and the integer array *ind is the map of the sorted version of *a,
i.e. 

j = ind[i]

is the original location in the array *a of the number that is in
position i in the sorted array *a.

The assignment is due on Friday, November 10.