linux下c语言的8种排序法

1. 快速排序
2. 直接插入排序
3. 希尔排序
4. 简单选择排序
5. 堆排序
6. 冒泡排序
7. 归并排序
8. 基数排序

1快速排序

#include <stdio.h>

void QuickSort(int *a, int start, int end)
{
   
	int x = start;
	int y = end;
	int base = a[x];

	if (x >= y)
	{
   
		return;
	}

	while (x < y)
	{
   
		while (a[y] > base && x < y)
		{
   
			y--;
		}
		if (x < y)
		{
   
			a[x++] = a[y];
		}
		while (a[x] < base && x < y)
		{
   
			x++;
		}
		if (x < y)
		{
   
			a[y--] = a[x];
		}
	}
	a[x] = base;

	QuickSort(a, start, x - 1);
	QuickSort(a, x + 1, end);
}

int main()
{
   
	int i;
	//int array[] = {4, 2, 7, 9, 0, 6, 2, 1, 8, 3};
	int array[100000] = {
   0};
	srand(time(NULL));
	for (i = 0; i < 100000; i++)
	{
   
		array[i] = rand() % 1000 + 1;
	}

	QuickSort(array, 0, sizeof(array) / sizeof(array[0]) - 1);

	for (i = 0; i < sizeof(array) / sizeof(array[0]); i++)
	{
   
		printf("%d ", array[i]);
	}
	printf("\n");

	return 0;
}

2直接插入排序

#include <stdio.h>

void InsertSort(int *a, int length)
{
   
	int i, j, tmp;

	for (i = 1; i < length; i++)
	{
   
		tmp = a[i];	
		for (j = i - 1; j >= 0; j--)
		{
   
			if (tmp < a[j])
			{
   
				a[j + 1] = a[j];
			}
			else
			{
   
				break;
			}
		}
		a[j + 1] = tmp;
	}
}

int main()
{
   
	int i;
	//int array[] = {4, 2, 7, 9, 0, 6, 2, 1, 8, 3};
	int array[10000] = {
   0};
	srand(time(NULL));
	for (i = 0; i < 10000; i++)
	{
   
		array[i] = rand() % 1000 + 1;
	}

	InsertSort(array, sizeof(array) / sizeof(array[0]));

	for (i = 0; i < sizeof(array) / sizeof(array[0]); i++)
	{
   
		printf("%d ", array[i]);
	}
	printf("\n");

	return 0;
}

3希尔排序