数据结构常见的几种排序算法实现

1. 冒泡排序

void BubbleSort(int* arr, int len)
	{
		assert(arr);
		int i = 0;
		int j = 0;
		for (i = 0; i < len - 1; i++)
		{
			bool flag = true;
			for (j = 0; j < len - 1 - i; j++)
			{
				if (arr[j] > arr[j + 1])
				{
					swap(arr[j], arr[j + 1]);
					flag = false;
				}
			}
			if (flag)
				break;
		}
	}

3. 选择排序

void SelectionSort(int* a, int len)
	{
		assert(a);
		int i = 0;
		int j = 0;
		for (i = 0; i < len - 1; i++)
		{
			int min = i;
			for (j = i + 1; j < len;j++)
			{
				if (a[min] > a[j])
					min = j;
			}
			if (min != i)
				swap(a[min], a[i]);
		}
	}

5. 插入排序

void InsertSort(int* a, int len)
	{
		assert(a);
		int i = 0;
		int j = 0;
		for (i = 0; i < len-1; i++)
		{
			for (j = i; j >= 0; j--)
			{
				if (a[j] > a[j + 1])
				{
					swap(a[j], a[j + 1]);
				}
				else
					break;
			}
		}
	}

7. 快速排序

void swap(int *a, int *b)
{
	int tmp = *a;
	*a = *b;
	*b = tmp;
}
 
int partition(int a[], int low, int high)
{
	int privotKey = a[low];                             //基准元素
	while (low < high) {                                   //从表的两端交替地向中间扫描
 
 
		while (low < high  && a[high] >= privotKey) --high;  //从high 所指位置向前搜索，至多到low+1 位置。将比基准元素小的交换到低端
		swap(&a[low], &a[high]);
 
		while (low < high  && a[low] <= privotKey) ++low;
		swap(&a[low], &a[high]);
 
	}
	print(a, 10);
	return low;
}
void quickSort(int a[], int low, int high) {
	if (low < high) {
		int privotLoc = partition(a, low, high);  //将表一分为二
		quickSort(a, low, privotLoc - 1);          //递归对低子表递归排序
		quickSort(a, privotLoc + 1, high);        //递归对高子表递归排序
	}
}