c/c++各种排序算法

//冒泡排序
void bubble_sort(int *arr, int len)
{
	for(int i=0;i<len-1;i++)
		for (int j = 0; j < len-i-1; j++)
			if (arr[j] > arr[j + 1])
			{
				arr[j] ^= arr[j + 1];
				arr[j + 1] ^= arr[j];
				arr[j] ^= arr[j + 1];
			}
}
//选择排序
void select_sort(int *arr, int len)
{
	for (int i = 0; i < len-1; i++)
		for (int j = i + 1; j < len; j++)
			if (arr[j] < arr[i])
			{
				arr[i] ^= arr[j];
				arr[j] ^= arr[i];
				arr[i] ^= arr[j];
			}
}
//插入排序
void insert_sort(int arr[], int len)
{
	for (int i = 1; i < len; i++)
	{
		int temp = arr[i];
		int j = i - 1;
		while (arr[j] > temp && j >= 0)
			arr[j + 1] = arr[j--];
		arr[j + 1] = temp;
	}
}
//希尔排序
void shell_sotr(int *arr, int len)
{
	int jump = len;
	while (jump >>= 1)
		for (int i = jump; i < len; i++)
		{
			int temp = arr[i],
				j = i - jump;
			for (; 0 <= j&&arr[j] > temp; j -= jump)
				arr[j + jump] = arr[j];
			arr[j + jump] = temp;
		}
}
//基数(优化=>单桶)排序
void radix_sort(int arr[], int len)
{
	int *temp = (int*)calloc(1, sizeof(int)*LEN);
	for (int i = 0; i < len; i++)
		temp[arr[i]]++;
	int k = 0;
	for (int i = 0; i < len; i++)
		for (int j = 0; j < temp[i]; j++)
			arr[k++] = i;
	free(temp);
}
//桶排序
void bucket_sort(int arr[], int len)
{
	int **temp = new int*[10];

	for (int i = 0; i < 10; i++)
		temp[i] = new int[LEN];

	for (int n = 1; n < 1000; n *= 10)
	{
		for (int i = 0; i < 10; i++)
			memset(temp[i], -1, sizeof(int)*LEN);

		for (int i = 0; i < len; i++)
			temp[arr[i] / n % 10][i] = arr[i];

		int k = 0;
		for (int i = 0; i < 10; i++)
			for (int j = 0; j < LEN; j++)
				if (-1 < temp[i][j])				
					arr[k++] = temp[i][j];
	}
	for (int i = 0; i < 10; i++)
		delete temp[i];
	delete temp;
}
//归并排序
void mergeSort(int *arr, int tail, int head = 0)
{
	if (tail - head < 2)
		return;

	int mid = (tail + head - 1) >> 1;
	mergeSort(arr, mid + 1);
	mergeSort(arr, tail, mid + 1);

	int len = tail - head + 1;
	int *temp = new int[len];
	int left = head, right = mid + 1;
	int k = 0;
	while (left <= mid&&right <= tail)
	{
		if (arr[left] < arr[right])
			temp[k++] = arr[left++];
		else
			temp[k++] = arr[right++];
	}
	memcpy(&temp[k], &arr[left], sizeof(int)*(mid - left + 1));
	memcpy(&temp[k], &arr[right], sizeof(int)*(tail - right + 1));
	memcpy(&arr[head], temp, sizeof(int)*len);
	delete[]temp;
}