px

一、冒泡排序 void BubbleSort(int arr[], int length) { for (int i = 0; i < length; i++) { for (int j = 0; j < length - i - 1; j++) { if (arr[j] > arr[j + 1]) { int temp; temp = arr[j + 1]; arr[j + 1] = arr[j]; arr[j] = temp; } } } } 二、选择排序 void SelectionSort(int arr[], int length) { int index, temp; for (int i = 0; i < length; i++) { index = i; for (int j = i + 1; j < length; j++) { if (arr[j] < arr[index]) index = j; } if (index != i) { temp = arr[i]; arr[i] = arr[index]; arr[index] = temp; } } } 三、插入排序 void InsertSort(int arr[], int length) { for (int i = 1; i < length; i++) { int j; if (arr[i] < arr[i - 1]) { int temp = arr[i]; for (j = i - 1; j >= 0 && temp < arr[j]; j–) { arr[j + 1] = arr[j]; } arr[j + 1] = temp; } } } 四、归并排序 void MergeSort(int arr[], int start, int end, int * temp) { if (start >= end) return; int mid = (start + end) / 2; MergeSort(arr, start, mid, temp); MergeSort(arr, mid + 1, end, temp); int length = 0; int i_start = start; int i_end = mid; int j_start = mid + 1; int j_end = end; while (i_start <= i_end && j_start <= j_end) { if (arr[i_start] < arr[j_start]) { temp[length] = arr[i_start]; length++; i_start++; } else { temp[length] = arr[j_start]; length++; j_start++; } } while (i_start <= i_end) { temp[length] = arr[i_start]; i_start++; length++; } while (j_start <= j_end) { temp[length] = arr[j_start]; length++; j_start++; } for (int i = 0; i < length; i++) { arr[start + i] = temp[i]; } } 五、快速排序 void QuickSort(int arr[], int start, int end) { if (start >= end) return; int i = start; int j = end; int baseval = arr[start]; while (i < j) { while (i < j && arr[j] >= baseval) { j–; } if (i < j) { arr[i] = arr[j]; i++; } while (i < j && arr[i] < baseval) { i++; } if (i < j) { arr[j] = arr[i]; j–; } } arr[i] = baseval; QuickSort(arr, start, i - 1); QuickSort(arr, i + 1, end); }