各种排序法

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#define MAXSIZE 100000
typedef int KeyType;
typedef int InfoType;
typedef struct{
  KeyType key;
  InfoType otherinfo;
}RedType;
typedef struct{
  RedType r[MAXSIZE+1];
  int length;
}SqList;

/*直接插入排序*/
void InsertSort(SqList *L)
{
  int i,j;
  for(i=2;i<=L->length;++i)
    if (L->r[i].key<L->r[i-1].key)
{
      L->r[0]=L->r[i];
      for(j=i-1;L->r[0].key<L->r[j].key; --j)
         L->r[j+1]=L->r[j];
      L->r[j+1]=L->r[0];
    }
}

/*折半插入排序*/
void BInsertSort(SqList *L)
{
  int i,j;
  int low,high,m;
  for(i=2;i<=L->length;++i){
    L->r[0]=L->r[i];
    low=1;high=i-1;
    while(low<=high){
      m=(low+high)/2;
      if (L->r[0].key<L->r[m].key)
 high=m-1;
      else low=m+1;
    }
    for(j=i-1;j>=high+1;--j)
      L->r[j+1]=L->r[j];
    L->r[high+1]=L->r[0];
  }
}

/* 快速排序 */
int Partition(SqList *L,int low,int high)
{
  int pivotkey;
  L->r[0]=L->r[low];
  pivotkey=L->r[low].key;
  while(low<high){
    while(low<high&&L->r[high].key>=pivotkey) --high;
    L->r[low]=L->r[high];
    while(low<high&&L->r[low].key<=pivotkey) ++low;