merge.c

排序算法的实现

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




void mergeway(float *p,float *p1,long n,long m)
{ long t;
  
  void merge(float *p,float *p1,long n,long t,long m);
 if(n<m)
  { 
    if(m-n==1)
    { merge(p,p1,n,n,m);
    }

    t=(long)((m+n)/2);
    mergeway(p,p1,n,t);
    mergeway(p,p1,t+1,m);
    merge(p,p1,n,t,m);
   }
   return;
}

void merge(float *p,float *p1,long n,long t,long m)
{ 
  long i,j=t+1,k=n;
  
  if(m-n==1)
  {  float temp;
      if(p[m]<p[n])
      { temp=p[n];
        p[n]=p[m];
        p[m]=temp;
       
       }
    return;
  }
  
  
  i=n;
  while(i<=m)
  { p1[i]=p[i];
    i++;
  }
  

  i=n;
  while(i<=t&&j<=m&&k<=m)
  { if(p1[i]<=p1[j])
     { p[k++]=p1[i++];
     }
   else
   { p[k++]=p1[j++];}
  }
  while(i<=t&&k<=m)
  { p[k++]=p1[i++];
  }
  while(j<=m&&k<=m)
  { p[k++]=p1[j++];
  }
  
  return;
}