数组排序

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

int main()
{
    void arr_print(int* a,int n);      //打印数组
    void burble_sort(int *a,int n);    //冒泡排序
    void select_sort(int *a,int n);    //选择排序
    void shell_sort(int *a,int n);     //希尔排序
    void quick_sort(int a[],int left,int right);//快速排序
    void insertion_sort(int a[],int len);//插入
    int a[10]= {1,4,6,3,7,8,68,9,5,12};
    printf("原始数据:
");
    arr_print(a,10);

    printf("冒泡排序:
");
    burble_sort(a,10);

    printf("选择排序:
");
    select_sort(a,10);

    printf("希尔排序:
");
    shell_sort(a,10);

    printf("快速排序;
");
    quick_sort(a,5,5);

    printf("插入排序:
");
    insertion_sort( a,10);
    return 0;
}
/****显示数据****/
void arr_print(int *a,int n)
{
    int i=0;
    for(i=0; i<n; i++)
    {
        printf("%3d",a[i]);
    }
    printf("
");
}
/*****冒泡排序******/
void burble_sort(int *a,int n)
{
    int i=0,j=0;
    for(i=0; i<n; i++)
    {
        for(j=0; j<n-i-1; j++)
        {
            if(a[j]>a[j+1])
            {
                int temp;
                temp=a[j];
                a[j]=a[j+1];
                a[j+1]=temp;
            }
        }
    }
    arr_print(a,10);
}
/*****选择排序*****/
void select_sort(int *a, int n)
{
    int i, j, index, value;
    for (i = 0; i < n - 1; i ++)
    {
        index = i;      //记录当前下标
        value = a[i];   //保留当前值
        for (j = i + 1; j < n; j ++)
        {
            if (value > a[j])
            {
                index = j; //交换下标
                value = a[j];//交换值
            }
            a[index] = a[i];
            a[i] = value;
        }
    }
    arr_print(a,10);
}
/*****希尔排序****/
void shell_sort(int *a,int n)
{
    int j,i,key;
    int gap=0;
    if( n <= 0 || a == NULL )
    {
        return;
    }
    while( gap <= n )
    {
        gap = gap*3+1;
    }
    while( gap > 0 )
    {
        for( i=gap; i<n; i++ )
        {
            j = i-gap;
            key = a[i];
            while ( (j >= 0) && (a[j] > key) )
            {
                a[j+gap] = a[j];
                j = j-gap;
            }
            a[j+gap] = key;
        }
        //display_array(len,a,gap);
        gap = (gap - 1)/3;
    }
    arr_print(a,10);
}
/****快速排序*****/
 void quick_sort(int a[],int left,int right)
{
   int i,j,temp;
   i=left;
   j=right;
   temp=a[left];
   if(left>right)
      return;
   while(i!=j)/**//*找到最终位置*/
   {
      while(a[j]>=temp && j>i)
         j--;
      if(j>i)
         a[i++]=a[j];

      while(a[i]<=temp && j>i)
          i++;
      if(j>i)
          a[j--]=a[i];
   }
   a[i]=temp;
   quick_sort(a,left,i-1);/**//*递归左边*/
   quick_sort(a,i+1,right);/**//*递归右边*/
   arr_print(a,10);
   return 0;
}
/*****插入排序******/
void insertion_sort( int a[], int len)
{
    int j,i,key;
    if( len <= 0 )
        return;
    for( j=1; j<len; ++j )
    {
        key = a[j];
        i = j - 1;
        while ( i >= 0 && a[i] > key )
        {
            a[i+1] = a[i];
            --i;
        }
        a[i+1] = key;
    }
    arr_print(a,10);
}