Merge sort (sorted arrays)
I have some already sorted arrays of the same type and I want to sort them efficiently into one array. I guess the best method is the merge sort. Each element of these arrays is an object user-defined and has a size of about 8 integers. My question is if it is worthy to create an array of pointers to the elements of these arrays, which pointers will be ordered according to the value of the objects instead of a new array with a copy of the objects.
For example, given the arrays Objects a, b, c, d I create the array Objects *sorted.
sorted = &b;
sorted = &d;
sorted = &a;
sorted = &a'
sorted = &c;
Note: I don't want to loose the initial arrays from the memory.