C语言中常见排序算法汇总

/****************************************************
*常用排序函数:希尔排序 冒泡排序 选择排序
*  快速排序 归并排序
****************************************************/
#include <stdio.h>
#include <ctype.h>
#include <stdlib.h>
#define MAXLINE 1000

//===================函数声明===================
void shellsort(int arr[], int n); //希尔排序法
void bubblesort(int arr[], int n); //冒泡排序法
void choosesort(int arr[], int n); //选择排序法
void quicksort(int arr[], int low, int high); //快速排序法
int findpos(int arr[], int low, int high); //快排找位置函数
void merge_sort(int arr[], int low, int high); //归并排序法
void merge(int arr[], int first, int mid, int last); //归并函数


int main(void)
{
char s[10];
char c = 'y';
int nums, i;
int arr[] = {55,-3,22,12,10,45,33};


merge_sort(arr, 0, 6);
for(i = 0; i < 7; i++)
{
printf("%d\t", arr[i]);
}


return 0;
}
//===================希尔排序法===================
void shellsort(int arr[], int n)
{
int gap, i, j, tmp;


for(gap = n/2; gap >0; gap /= 2)
{
for(i = gap; i < n; i++)
{
for(j = i - gap; j>=0 && arr[j] > arr[j+gap]; j -= gap)
{
tmp = arr[j];
arr[j] = arr[j+gap];
arr[j+gap] = tmp;
}
}
}


return;
}
//===================冒泡排序法===================
void bubblesort(int arr[], int n)
{
int i, j, tmp;
int flag;


flag = 1;
for(i = 0; i < n - 1; i++)
{
for(j = 0; j < n - 1 - i; j++)
{
if(arr[j] > arr[j+1])
{
tmp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = tmp;
flag = 0;
}
if(1 == flag)
{
break;
}
}
}


return;
}
//===================选择排序法===================
void choosesort(int arr[], int n)
{
int i, j, k, tmp;


for(i = 0; i < n - 1; i++)
{
k = i;
for(j = i + 1; j < n; j++)
{
if(arr[k] > arr[j])
{
k = j;
}
}
if(k != i)
{
tmp = arr[i];
arr[i] = arr[k];
arr[k] = tmp;
}

}

return;

}
//===================快速排序法===================
int findpos(int arr[], int low, int high)
{
int val = arr[low];


while(low < high)
{
while(low < high && arr[high] > val)//两个条件都在这里判断
{
--high;
}
if(low < high)
arr[low] = arr[high];
while(low < high && arr[low] < val)
{
++low;
}
if(low < high)
arr[high] = arr[low];
}
arr[low] = val;


return low;
}


void quicksort(int arr[], int low, int high)
{
int pos;


if(low < high)
{
pos = findpos(arr, low, high);
quicksort(arr, low, pos-1);
quicksort(arr, pos+1, high);
}


return;
}
//===================归并排序法===================
void merge_sort(int arr[], int low, int high)
{
int mid;


if(low < high)
{
mid = (low + high)/2;
merge_sort(arr, low, mid);
merge_sort(arr, mid+1, high);
merge(arr, low, mid, high);

}

return;

}
void merge(int arr[], int first, int mid, int last)
{
int i, j, k; //循环变量
int n1, n2; //两个数组的长度
int *front, *back; //动态数组指针


n1 = mid - first + 1;
n2 = last - mid;
front = (int *)malloc(sizeof(int)*n1);
back = (int *)malloc(sizeof(int)*n2);
for(i = 0; i < n1; i++)
{
front[i] = arr[first + i];
}
for(i = 0; i < n2; i++)
{
back[i] = arr[mid + 1 + i];
}
i = 0;
j = 0;
k = first;
while(i < n1 && j < n2)
{
if(front[i] < back[j])
{
arr[k++] = front[i++];
}
else
{
arr[k++] = back[j++];
}
}
while(i < n1)
{
arr[k++] = front[i++];
}
while(j < n2)
{
arr[k++] = back[j++];
}
free(front);
free(back);

return;
}