qsort.c

算法函数库 算法函数库

#include "stdio.h"
long number[100000000];
long n;
void myqsort(long left,long right)
{
     long middle,inleft,inright;
     long temp,i;
     inleft=left;inright=right;
     if(inleft<inright)
     {
         middle=(inleft+inright)/2;
         if(number[inleft]>number[inright])
         {
             temp=number[inleft];
             number[inleft]=number[inright];
             number[inright]=temp;
             inleft++;inright--;
         }
         while(inleft<inright)
         {
             if(number[inleft]<number[middle])
             {
                 inleft++;
             }
             else
             {
                 if(number[inright]>=number[middle]){inright--;}
                 else
                 {
                     temp=number[inleft];
                     number[inleft]=number[inright];
                     number[inright]=temp;
                     inleft++;
                 }
             }
         }
         myqsort(left,inleft-1);
         myqsort(inright+1,right);
     }
}
int main()
{
    long i;
    printf("n=");scanf("%ld",&n);
    for(i=0;i<n;i++){scanf("%ld",&number[i]);}
    myqsort(0,n-1);
    for(i=0;i<n;i++){printf("%ld ",number[i]);}
    system("pause");
    return 0;
}