六种常见排序的C实现

#include <stdio.h>
void bubble_sort(int *array,int len)//冒泡排序
{
int i,j;
int flag=1;
for(i=0;i<len-1&&flag;i++)
{
flag=0;
for(j=0;j<len-1-i;j++)
{
if(array[j]>array[j+1])
{
int tmp=array[j];
array[j]=array[j+1];
array[j+1]=tmp;
flag=1;
}
}
}
}
void select_sort(int*array,int len)//选择排序
{
int i,j;
int min;
for(i=0;i<len-1;i++)
{
min=i;
for(j=i+1;j<len;j++)
{
if(array[j]>array[min])
min=j;
}
if(min!=i)
{
int tmp=array[i];
array[i]=array[min];
array[min]=tmp;
}
}
}
void insert_sort(int*array,int len)//插入排序
{
int i,j;
int index,tmp;
for(i=1;i<len;i++)
{
index=i;
tmp=array[i];
for(j=i-1;j>=0&&tmp>array[j];--j)
{
array[j+1]=array[j];
index=j;
}
array[index]=tmp;
}
}
void shell_sort(int*array,int len)//希尔排序
{
int i,j,k;
int index,tmp;
int gap=len/2;

while(gap)
{
for(i=0;i<gap;i++)
{
for(j=i+gap;j<len;j+=gap)
{
index=j;
tmp=array[j];
for(k=j-gap;k>=0&&tmp>array[k];k-=gap)
{
array[k+gap]=array[k];
index=k;
}
array[index]=tmp;
}
}
gap=gap/2;
}
}
int findpos(int*array,int low,int high)
{
int n=array[low];
while(low<high)
{
while(low<high&&n<=array[high])
high--;
array[low]=array[high];
while(low<high&&n>=array[low])
low++;
array[high]=array[low];

array[low]=n;
return low;
}
}


void quick_sort(int*array,int low,int high)//快速排序
{
if(low<high)
{
int pos=findpos(array,low,high);
quick_sort(array,low,pos-1);
quick_sort(array,pos+1,high);
}

}

void merge_array(int*array,int low,int mid,int high,int*buf)
{
int leftstart=low;
int leftend=mid;
int rightstart=mid+1;
int rightend=high;

int i=leftstart;
int j=rightstart;
int length=0;

while(i<=leftend&&j<=rightend)
{
if(array[i]<array[j])
buf[length++]=array[i++];
else
buf[length++]=array[j++];
}
while(i<=leftend)
buf[length++]=array[i++];
while(j<=rightend)
buf[length++]=array[j++];
for(i=0;i<length;i++)
array[low+i]=buf[i];
}
void merge_sort(int*array,int low,int high,int*buf)//归并排序
{
if(low<high)
{
int mid=(low+high)/2;
merge_sort(array,low,mid,buf);
merge_sort(array,mid+1,high,buf);
merge_array(array,low,mid,high,buf);
}
}

int main(void)
{
int array[]={12,34,56,78,90,98,76,54,32,21};
int len=sizeof(array)/sizeof(array[0]);
int i=0;

//bubble_sort(array,len);
//select_sort(array,len);
//insert_sort(array,len);
//shell_sort(array,len);
\/quick_sort(array,0,len-1);
merge_sort(

for(i=0;i<len;i++)
{
printf("%d ",array[i]);
}
putchar(10);

return 0;
}