C语言基本排序算法程序,很有用

#include "stdlib.h"
#include <stdio.h>
#define s 100
typedef struct record
{int key;};
static  struct record a1[s],a2[s],a3[s],a4[s],a5[s],a6[s],rec;
int a[7],b[7];
file()
 {
 printf("                *********************************  \n");
 printf("                ***      *1. 直接插入排序     ***  \n");
 printf("                ***      *2. 希尔排序         ***  \n");
 printf("                ***      *3. 冒泡排序         ***  \n");
 printf("                ***      *4. 快速排序         ***  \n");
 printf("                ***      *5. 简单选择排序     ***  \n");
 printf("                ***      *6. 堆排序           ***  \n");
 printf("                ***      *7. 总结             ***  \n");
 printf("                ***      *0. 退出             ***  \n");
 printf("                *********************************  \n");   }


void Straight_insert_sort(r,n) /*直接插入*/

struct record r[];
int n;
 { int i,j;
    a[1]=0;b[1]=0;
     for(i=1;i<=n;i++)
      printf("%4d",r[i].key);
      printf("\n");

  for(i=2;i<=n;i++)
   {  r[0]=r[i];
      j=i-1;
      while((j>=0) && (r[0].key<r[j].key))
       { b[1]++;
  r[j+1]=r[j--];
  r[j+1]=r[0];
  a[1]=a[1]+2;
 }
     }
   printf("************直接插入******************\n");
   for(i=1;i<=n;i++)
   printf("%4d",r[i]);
   printf("\n");
   printf("move:%d  time,    compete:%d  time",a[1],b[1]);
   printf("\n");
 }


void Shell_sort(r,n)   /*     希 尔 排 序    */
struct record r[];
int n;
{   struct record rec,temp;
    int i,j,t,h;
    a[2]=0;b[2]=0;
    for(i=1;i<=n;i++)
    printf("%4d",r[i].key);
    printf("\n");
    t=n/2;
   while(t>=1)