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 203 204 205 206 207 208
| 1插入排序
void insert_sort() { for (int i = 1; i < n; i ++ ) { int x = a[i]; int j = i-1;
while (j >= 0 && x < a[j]) { a[j+1] = a[j]; j -- ; } a[j+1] = x; } } 2选择排序
void select_sort() { for (int i = 0; i < n; i ++ ) { int k = i; for (int j = i+1; j < n; j ++ ) { if (a[j] < a[k]) k = j; } swap(a[i], a[k]); }
} 3冒泡排序
void bubble_sort() { for (int i = n-1; i >= 1; i -- ) { bool flag = true; for (int j = 1; j <= i; j ++ ) if (a[j-1] > a[j]) { swap(a[j-1], a[j]); flag = false; } if (flag) return; } } 4希尔排序
void shell_sort() { for (int gap = n >> 1; gap; gap >>= 1) { for (int i = gap; i < n; i ++ ) { int x = a[i]; int j; for (j = i; j >= gap && a[j-gap] > x; j -= gap) a[j] = a[j-gap]; a[j] = x; } } } 5快速排序(最快)
void quick_sort(int l, int r) { if (l >= r) return ;
int x = a[l+r>>1], i = l-1, j = r+1; while (i < j) { while (a[++ i] < x); while (a[-- j] > x); if (i < j) swap(a[i], a[j]); } sort(l, j), sort(j+1, r); } 6归并排序
void merge_sort(int l, int r) { if (l >= r) return; int temp[N]; int mid = l+r>>1; merge_sort(l, mid), merge_sort(mid+1, r); int k = 0, i = l, j = mid+1; while (i <= mid && j <= r) { if (a[i] < a[j]) temp[k ++ ] = a[i ++ ]; else temp[k ++ ] = a[j ++ ];
} while (i <= mid) temp[k ++ ] = a[i ++ ]; while (j <= r) temp[k ++ ] = a[j ++ ]; for (int i = l, j = 0; i <= r; i ++ , j ++ ) a[i] = temp[j]; } 7堆排序(须知此排序为使用了模拟堆,为了使最后一个非叶子节点的编号为n/2,数组编号从1开始) https:
void down(int u) { int t = u; if (u<<1 <= n && h[u<<1] < h[t]) t = u<<1; if ((u<<1|1) <= n && h[u<<1|1] < h[t]) t = u<<1|1; if (u != t) { swap(h[u], h[t]); down(t); } }
int main() { for (int i = 1; i <= n; i ++ ) cin >> h[i]; for (int i = n/2; i; i -- ) down(i); while (true) { if (!n) break; cout << h[1] << ' '; h[1] = h[n]; n -- ; down(1); } return 0; } 8基数排序
int maxbit() { int maxv = a[0]; for (int i = 1; i < n; i ++ ) if (maxv < a[i]) maxv = a[i]; int cnt = 1; while (maxv >= 10) maxv /= 10, cnt ++ ;
return cnt; } void radixsort() { int t = maxbit(); int radix = 1;
for (int i = 1; i <= t; i ++ ) { for (int j = 0; j < 10; j ++ ) count[j] = 0; for (int j = 0; j < n; j ++ ) { int k = (a[j] / radix) % 10; count[k] ++ ; } for (int j = 1; j < 10; j ++ ) count[j] += count[j-1]; for (int j = n-1; j >= 0; j -- ) { int k = (a[j] / radix) % 10; temp[count[k]-1] = a[j]; count[k] -- ; } for (int j = 0; j < n; j ++ ) a[j] = temp[j]; radix *= 10; }
} 9计数排序
void counting_sort() { int sorted[N]; int maxv = a[0]; for (int i = 1; i < n; i ++ ) if (maxv < a[i]) maxv = a[i]; int count[maxv+1]; for (int i = 0; i < n; i ++ ) count[a[i]] ++ ; for (int i = 1; i <= maxv; i ++ ) count[i] += count[i-1]; for (int i = n-1; i >= 0; i -- ) { sorted[count[a[i]]-1] = a[i]; count[a[i]] -- ; } for (int i = 0; i < n; i ++ ) a[i] = sorted[i]; } 10桶排序(基数排序是桶排序的特例,优势是可以处理浮点数和负数,劣势是还要配合别的排序函数)
vector<int> bucketSort(vector<int>& nums) { int n = nums.size(); int maxv = *max_element(nums.begin(), nums.end()); int minv = *min_element(nums.begin(), nums.end()); int bs = 1000; int m = (maxv-minv)/bs+1; vector<vector<int> > bucket(m); for (int i = 0; i < n; ++i) { bucket[(nums[i]-minv)/bs].push_back(nums[i]); } int idx = 0; for (int i = 0; i < m; ++i) { int sz = bucket[i].size(); bucket[i] = quickSort(bucket[i]); for (int j = 0; j < sz; ++j) { nums[idx++] = bucket[i][j]; } } return nums; }
|