0

I am having problem with sorting and need help with it.

I have to sort the integers in an array and finally after sorting the index number of all the elements before sorting are to be preserved.

I have used merge sort. The sorting is done but the index numbers are not preserved. This is the code I have used for merge sort:

```
#include <stdlib.h>
#include <stdio.h>
#define NUM_ITEMS 9
void mergeSort(int numbers[], int temp[], int array_size);
void m_sort(int numbers[], int temp[], int left, int right);
void merge(int numbers[], int temp[], int left, int mid, int right);
int numbers[]={1,3, 5, 7, 9, 2, 4, 8, 10};
int temp[9];
int main()
{
int i;
//seed random number generator
//srand(getpid());
//fill array with random integers
//for (i = 0; i < NUM_ITEMS; i++)
// numbers[i] = rand();
//perform merge sort on array
mergeSort(numbers, temp, NUM_ITEMS);
printf("Done with sort.\n");
for (i = 0; i < NUM_ITEMS; i++)
printf("%i\n", numbers[i]);
}
void mergeSort(int numbers[], int temp[], int array_size)
{
m_sort(numbers, temp, 0, array_size - 1);
}
void m_sort(int numbers[], int temp[], int left, int right)
{
int mid;
if (right > left)
{
mid = (right + left) / 2;
m_sort(numbers, temp, left, mid);
m_sort(numbers, temp, mid+1, right);
merge(numbers, temp, left, mid+1, right);
}
}
void merge(int numbers[], int temp[], int left, int mid, int right)
{
int i, left_end, num_elements, tmp_pos;
left_end = mid - 1;
tmp_pos = left;
num_elements = right - left + 1;
while ((left <= left_end) && (mid <= right))
{
if (numbers <= numbers[mid])
{
temp[tmp_pos] = numbers;
tmp_pos = tmp_pos + 1;
left = left +1;
}
else
{
temp[tmp_pos] = numbers[mid];
tmp_pos = tmp_pos + 1;
mid = mid + 1;
}
}
while (left <= left_end)
{
temp[tmp_pos] = numbers;
left = left + 1;
tmp_pos = tmp_pos + 1;
}
while (mid <= right)
{
temp[tmp_pos] = numbers[mid];
mid = mid + 1;
tmp_pos = tmp_pos + 1;
}
for (i=0; i <= num_elements; i++)
{
numbers = temp;
right = right - 1;
}
}
```

Please help me to modify this code or write another code so that I could also preserve the index numbers of the unsorted array, even after sorting.