1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 |
| #include <iostream> using namespace std; void Swap(int array[], int i, int j) { int tmp = array[i]; array[i] = array[j]; array[j] = tmp; } void BubbleSort1(int array[], int len) { int exchange = 1;//表示没有排序 for (int i = 0; i < len && exchange; ++i) { exchange = 0; for (int j = len-1; j >i; j--) { if(array[j] < array[j-1]) { Swap(array, j, j-1); exchange = 1; } } } } void BubbleSort2(int array[], int len) { for (int i = 0; i < len; ++i) { for(int j = 0; j<len-i-1; j++) { if (array[j] > array[j+1]) { Swap(array, j, j+1); } } } } void SelectSort(int array[], int len) { for (int i = 0; i < len; ++i) { int min = i; for(int j = i+1; j < len ; j++) { if (array[min] > array[j]) { min = j; } } Swap(array,i, min); } } void InsertSort(int array[], int len) { for (int i = 1; i <len; i++) { int k = i;//待插入的位置 int tmp = array[k]; for(int j = i-1; (j>=0) && (tmp < array[j]);j--) { array[j+1] = array[j]; k = j; } array[k] = tmp; } } void ShellSort(int array[], int len) { int gap = len; do { gap = gap/3+1; for (int i = gap; i < len; ++i) { int k = i; int tmp = array[k]; for(int j=i-gap; (j>0)&& (tmp<array[j]);j--) { array[j+gap] = array[gap]; k = j; } array[k] = tmp; }
}while(gap>1); } void Merge(int src[], int des[], int low, int mid, int high) { int i = low; int j = mid+1; int k = low; while((i<=mid) && (j<= high)) { if (src[i] < src[j]) { des[k++] = src[i++]; } else { des[k++] = src[j++]; } } while(i <= mid) { des[k++] = src[i++]; } while(j <= high) { des[k++] = src[j++]; } } void MSort(int src[], int des[], int low, int high , int len) { if (low == high) { des[low] = src[low]; } else { int mid = (low+high)/2; int *space = (int*)malloc(sizeof(int)*len); if (space == NULL) { return; } MSort(src, space, low, mid, len); MSort(src, space, mid+1, high, len); Merge(space, des, low ,mid, high); free(space); } } void MergeSort(int array[], int len) { MSort(array, array, 0, len-1, len); } //-----快速排序------------ int partition(int array[], int low, int high) { int pv = array[low]; while(low < high) { while((low < high) && (array[high] > pv)) { high--; } Swap(array, low, high); while((low < high) && (array[low] <= pv)) { low++; } Swap(array, low, high); } return low; } void QSort(int array[], int low, int high) { if (low < high) { int pivot = partition(array, low, high); QSort(array, low , pivot-1); QSort(array, pivot+1, high); } } void QuickSort(int array[], int len) { QSort(array, 0, len-1); } void Printf(int array[], int len) { for (int i = 0; i < len; ++i) { cout << array[i] << " "; } cout << endl; } int main() { int array[] = {9,8,6,5,3,7}; int len = sizeof(array)/sizeof(int); cout << "冒泡排序从后往前...." << endl; BubbleSort1(array, len); Printf(array, len); cout << "冒泡排序从前往后...." << endl; BubbleSort2(array, len); Printf(array, len); cout << "选择排序...." << endl; SelectSort(array, len); Printf(array, len); cout << "插入排序...." << endl; InsertSort(array, len); Printf(array, len); cout << "希尔排序...." << endl; ShellSort(array, len); Printf(array, len); cout << "归并排序...." << endl; ShellSort(array, len); Printf(array, len); cout << "快速排序...." << endl; QuickSort(array, len); Printf(array, len); return 0; }
冒泡排序从后往前....
3 5 6 7 8 9
冒泡排序从前往后....
3 5 6 7 8 9
选择排序....
3 5 6 7 8 9
插入排序....
3 5 6 7 8 9
希尔排序....
3 5 6 7 8 9
归并排序....
3 5 6 7 8 9
快速排序....
3 5 6 7 8 9
[Finished in 0.9s]
验证
|