C++排序算法

//冒泡排序
void bubbleSort(int arr[], int len) {
   
	int temp=0;
	for (int i= 0; i < len -1; i++) {
   
		for (int j=0; j < len -1-i; j++) {
   
			if (arr[j] < arr[j+1]) {
   
				temp = arr[j];
				arr[j] = arr[j+1];
				arr[j+1] = temp;
			}
		}
	}
}

//选择排序
void selectionSort(int arr[], int len) {
   
	int maxNum, temp;
	for (int i = 0; i < len -1; i++) {
   
		maxNum = i;
		for (int j = i + 1; j < len; j++) {
   
			if (arr[maxNum] < arr[j])
				maxNum = j;
		}
		//交换
		temp = arr[maxNum];
		arr[maxNum] = arr[i];
		arr[i] = temp;
	}
}

//插入排序
//方法1
void insertionSort0(int arr[], int len) {
   
	int temp;
	for (int i = 0; i < len -1; i++) {
   
		temp = arr[i];
		for (int j = 0; j < i+1; j++) {
   
			if (arr[i-j] >arr[i-j + 1]) {
   
				temp = arr[i-j + 1];
				arr[i -j+ 1] = arr[i-j];
				arr[i-j] = temp;
			}
		}
	}
}
//方法2
void insertionSort1(int arr[], int len) {
   
	int temp;
	for (int i = 0; i < len - 1; i++) {
   
		temp = arr[i+1];
		int pre = i;
		while((arr[pre]>temp)&&(pre>=0)) {
   
			arr[pre + 1] = arr[pre];
			pre--;
		}
		arr[pre + 1] = temp;
	}
}

//希尔排序
void shellSort(int arr[],int len) {
   
	int gap = floor(len / 2),temp;
	while (gap > 0) {
   
		for (int i = gap; i < len; i++) {
   
			temp = arr[i];