8.12 各种排序方式

8种基本排序方法： 冒泡排序， 插入排序， 希尔排序， 选择排序， 快速排序， 堆排序， 归并排序， 基数排序

一。 冒泡排序

#include <stdio.h>

void BubbleSort(int array[], int len)
{
	int i, j;
	int temp;

	for (i = 0; i < len -1; i++)
	{
		for (j = len - 1; j > i; j--)
		{
			if (array[j] < array[j - 1])
			{
				temp = array[j];
				array[j] = array[j - 1];
				array[j - 1] = temp;
			}
		}
	}
}

int main()
{
	int i = 0;
	int a[] = {29, 18, 87, 56, 3, 27};
	int length = sizeof(a) / sizeof(a[0]);

	BubbleSort(a, length);

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

	return 0;
}

二    插入排序

#include <stdio.h>

void InsertSort(int par_array[], int array_size)
{
	int i, j;
	int temp;

	for (i = 1; i < array_size; i++)
	{
		temp = par_array[i];

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

int main()
{            
	int i = 0;
	int a[] = {3, 5, 2, 1, 9, 0, 6, 4, 7, 8};
	int length = sizeof(a) / sizeof(a[0]);

	InsertSort(a, length);

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

	return 0;
}

三  希尔排序

#include <stdio.h>

void ShellSort(int array[], int length)
{
	int i, j;
	int h;
	int temp;

	for (h = length / 2; h > 0; h = h / 2)
	{
		for (i = h; i < length; i++)
		{
			temp = array[i];

			for (j = i - h; j >= 0; j -=h)
			{
				if (temp < array[j])
				{
					array[j + h] = array[j];
				}
				else
				{
					break;
				}
			}
			array[j + h] = temp;
		}
	}
}

int main()
{
	int i = 0;
	int a[] = {0, 5, 2, 4, 3, 1, 7, 6, 8, 9};
	int length = sizeof (a) / sizeof(a[0]);

	ShellSort(a, length);

	for (i = 0; i < length; i++)
	{
		printf("%d ", a[i]);
	}
	printf("\n");
	return 0;
		
}

四   选择排序

#include <stdio.h>

void SelectSort(int *a, int n)
{
	int i, j;
	int temp = 0;
	int flag = 0;

	for (i = 0; i < n - 1; i++)
	{
		temp = a[i];
		flag = i;
		for (j = i + 1; j < n; j++)
		{
			if (a[j] < temp)
			{
				temp = a[j];
				flag = j;
			}
		}
		if (flag != i)
		{
			a[flag] = a[i];
			a[i] = temp;
		}
	}
}

int main()
{
	int i = 0;
	int a[] = {5, 4, 3, 6, 1, 9, 7, 0, 2, 8};

	int length = sizeof(a) / sizeof(a[0]);

	SelectSort(a, length);

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

	return 0;
}

五  快速排序

#include <stdio.h>

void Sort(int array[], int low, int high)
{
	int i, j;
	int index;

	if (low >= high)
	{
		return;
	}

	i = low;
	j = high;
	index = array[i];

	while (i < j)
	{
		while (i < j && array[j] >= index)
		{
			j--;
		}
		if (i < j)
		{
			array[i++] = array[j];
		}
		while (i < j && array[i] < index )
		{
			i++;
		}
		if (i < j)
		{
			array[j--] = array[i];
		}
	}
	array[i] = index;
	Sort(array, low, i - 1);
	Sort(array, i + 1, high);
}

void QuickSort(int array[], int length)
{
	Sort(array, 0, length - 1);
}

int main()
{
	int i = 0;
	int a[] = {29, 96, 18, 56, 3, 56, 39, 77};
	int length = sizeof (a) / sizeof(a[0]);

	QuickSort(a, length);

	for (i = 0; i < length; i++)
	{
		printf("%d ", a[i]);
	}
	printf("\n");
	return 0;
}