Merge sort....with Resursion

/*
I am a beginer of C....
It is a merge sort using Resursion....
It can't sort now.....
Anyone can tell me where is the problems in the program?
Thank you very much!!
*/

Code:

---

#include<stdio.h>
#include<stdlib.h>

#define FILENAME "input.dat"
#define MAXSIZE 200
int temp[110];
int readfile(int data[],int size);

void mergesort(int merge[],int base,int size);
void merges(int merge[],int p,int l_end,int q,int r_end);


main(){
    int data[MAXSIZE];
    int insert[MAXSIZE];
        int merge[MAXSIZE];
        int quick[MAXSIZE];
        int size;
        int i;
        int base=0;

        /*intilize the array data*/
    for(i=0;i<=MAXSIZE-1;i++){
        data[i]=0;
        }
   
        size=readfile(data,MAXSIZE);

        for(i=0;i<=size-1;i++){
        insert[i]=data[i];
        merge[i]=data[i];
        quick[i]=data[i];
        }

 
    base=0;

    mergesort(merge,base,size);

 
        printf("Orignal    New order\n");
        for(i=0;i<=size-1;i++){
        printf("%d    ",merge[i]);
        printf("      %d \n",temp[i]);
        }
   
          /*for(i=0;i<=size-1;i++){
        printf("%d \n",temp[i]);
        }*/
   

}



/*merge sort*/
void mergesort(int merge[],int base,int size){
    int mid;
        if(base>=size) return;
       
        mid=(base+size)/2;       

        mergesort(merge,base,mid);
    mergesort(merge,mid+1,size);
   
        merges(merge,base,mid,mid+1,size);
}

/*merge*/
void merges(int merge[],int p,int l_end,int q,int r_end){
int pos;

pos=0;

    while((p<=l_end )&&(q<=r_end))
                if (merge[p]<=merge[q])
                temp[pos++]=merge[p++];
                else
                        temp[pos++]=merge[q++];
       
        while(p<=l_end)
                    temp[pos++]=merge[p++];
        while(q<=r_end)
                    temp[pos++]=merge[q++];


}




/* Read file from input.dat */
int readfile(int data[],int size){
  int i;
  FILE *in_file;
  if((in_file=fopen(FILENAME,"r"))==NULL)
  {
          printf("ERROR OF FILE OPEN!");
  }else{

 
      i=0;
          while(fscanf(in_file,"%i",&data[i])!=EOF){
          i=i+1;
          }
 

    fclose(in_file);
  }


return i;
}

---

CODE TAGS added by Hammer

Break your code down to just the merge sort and you can easily figure it out from there, here's my go at it by modifying your code :-)

Code:

---

#include<stdio.h>
#include<stdlib.h>

#define MAXSIZE 10

void mergesort(int merge[],int base,int size);
void merges(int merge[],int left,int mid,int right);

int main(void)
{
  int i;
  int merge[MAXSIZE] = {5,4,6,3,7,2,8,1,9};

  printf("Orignal\n");
  for(i = 0; i < 9; i++)
  {
    printf("%d ", merge[i]);
    fflush(stdout);
  }

  printf("\n");
  mergesort(merge, 0, 9);

  printf("New Order\n");
  for(i = 0; i < 9; i++)
  {
    printf("%d ", merge[i]);
    fflush(stdout);
  }

  printf("\n");
}

void mergesort(int merge[],int left,int right)
{
  int mid = (right+left)/2;
 
  if(right <= left)
  {
    return;
  }
 
  mergesort(merge, left, mid);
  mergesort(merge, mid+1, right);
  merges(merge, left, mid, right);
}

void merges(int merge[],int left,int mid,int right)
{
  int i, j, k;
  int temp[MAXSIZE];

  for (i = mid+1; i > left; i--)
  {
    temp[i-1] = merge[i-1];
  }
  for (j = mid; j < right; j++)
  {
    temp[right+mid-j] = merge[j+1];
  }
  for (k = left; k <= right; k++)
  {
    if (temp[j] < temp[i])
    {
      merge[k] = temp[j--];
    }
    else
    {
      merge[k] = temp[i++];
    }
  }
}

---