基本的排序算法

#include <cstring>
#include <iostream>
#include <utility>
using namespace std;
// 插入排序
void insertSort(int arr[], int len)
{
	if(arr == NULL || len <= 1)
	{
		return;
	}
	for(int i = 1; i < len; ++i)
	{
		int temp = arr[i];
		int j = i - 1;
		for(; j >= 0; --j)
		{
			if(arr[j] > temp)
			{
				arr[j + 1] = arr[j];
			}
			else
			{
				break;
			}
		}
		arr[j + 1] = temp;
	}
}
// 冒泡排序
void bubbleSort(int arr[], int len)
{
	if(arr == NULL || len <= 1)
	{
		return;
	}
	for(int i = 0; i < len - 1; ++i)
	{
		for(int j = 1; j < len - i; ++j)
		{
			if(arr[j - 1] > arr[j])
			{
				swap(arr[j - 1], arr[j]);
			}
		}
	}
}
// 选择排序
void selectSort(int arr[], int len)
{
	if(arr == NULL || len <= 1)
	{
		return;
	}
	for(int i = 0; i < len - 1; ++i)
	{
		int mini = i;
		for(int j = i + 1; j < len; ++j)
		{
			if(arr[j] < arr[mini])
			{
				mini = j;
			}
		}
		if(mini != i)
		{
			swap(arr[mini], arr[i]);
		}
	}
}
// 归并 s <= m < n
// part1: s -> m
// part2: m+1 -> n
void merge(int arr[], int arrCopy[], int s, int m, int n)
{
	int i = s;
	int j = m + 1;
	int k = s;
	while(i <= m && j <= n)
	{
		if(arr[i] <= arr[j])
		{
			arrCopy[k++] = arr[i++];
		}
		else
		{
			arrCopy[k++] = arr[j++];
		}
	}
	// 复制剩余数据
	if(i <= m)
	{
		copy(arr + i, arr + m + 1, arrCopy + k);
	}
	if(j <= n)
	{
		copy(arr + j, arr + n + 1, arrCopy + k);
	}
}
// 先排序两部分再合并
void mSort(int arr[], int arrCopy[], int start, int end)
{
	if(start == end)
	{
		return;
	}
	int mid = start + ((end - start) >> 1);
	mSort(arrCopy, arr, start, mid);
	mSort(arrCopy, arr, mid + 1, end);
	merge(arrCopy, arr, start, mid, end);
}
// 归并排序 
void mergeSort(int arr[], int len)
{
	if(arr == NULL || len <= 1)
	{
		return;
	}
	int* arrCopy = new int[len];
	memcpy(arrCopy, arr, sizeof(int) * len);
	mSort(arr, arrCopy, 0, len - 1);
}
// 分割数组
int partion(int arr[], int start, int end)
{
	int low = start;
	int high = end;
	int pivotKey = arr[start];
	while(low < high)
	{
		while(low < high && arr[high] >= pivotKey)
		{
			--high;
		}
		arr[low] = arr[high];
		while(low < high && arr[low] <= pivotKey)
		{
			++low;
		}
		arr[high] = arr[low];
	}
	arr[low] = pivotKey;
	return low;
}
// 快速排序
void quickSort(int arr[], int start, int end)
{
	if(arr == NULL || start >= end)
	{
		return;
	}
	int mid = partion(arr, start, end);
	quickSort(arr, start, mid - 1);
	quickSort(arr, mid + 1, end);
}
// 显示数组内容
void showArray(int arr[], int len)
{
	for(int i = 0; i < len; ++i)
	{
		cout << arr[i] << ' ';
	}
	cout << endl;
}
int main(int argc, char* argv[])
{
	int arr[] = {9, 1, 3, 8, 9, 2, 5, 4, 7, 6};
	int len = sizeof(arr) / sizeof(int);
	int* arrCopy = new int[len];

	memcpy(arrCopy, arr, len * sizeof(int));
	insertSort(arrCopy, len);
	cout << "插入排序:";
	showArray(arrCopy, len);

	memcpy(arrCopy, arr, len * sizeof(int));
	bubbleSort(arrCopy, len);
	cout << "冒泡排序:";
	showArray(arrCopy, len);

	memcpy(arrCopy, arr, len * sizeof(int));
	selectSort(arrCopy, len);
	cout << "选择排序:";
	showArray(arrCopy, len);

	memcpy(arrCopy, arr, len * sizeof(int));
	mergeSort(arrCopy, len);
	cout << "归并排序:";
	showArray(arrCopy, len);

	memcpy(arrCopy, arr, len * sizeof(int));
	quickSort(arrCopy, 0, len - 1);
	cout << "快速排序:";
	showArray(arrCopy, len);

	delete []arrCopy;
	return 0;
}

运行结果：

插入排序:1 2 3 4 5 6 7 8 9 9 
冒泡排序:1 2 3 4 5 6 7 8 9 9 
选择排序:1 2 3 4 5 6 7 8 9 9 
归并排序:1 2 3 4 5 6 7 8 9 9 
快速排序:1 2 3 4 5 6 7 8 9 9