快速排序
#include <iostream> using namespace std; const int N = 1e6 + 10; int n; int q[N]; void quick_sort(int q[], int l, int r) { if (l >= r) return; int x = q[l], i = l - 1, j = r + 1; while (i < j) { • do i++; while (q[i] < x); • do j--; while (q[j] > x); • if (i < j) swap(q[i], q[j]); } quick_sort(q, l, j); quick_sort(q, j + 1, r); } int main() { scanf("%d", &n); for (int i = 0; i < n; i++) scanf("%d", &q[i]); quick_sort(q, 0, n - 1); for (int i = 0; i < n; i++) printf("%d ", q[i]); return 0;
}
归并排序
#include <iostream> using namespace std; const int N = 1000010; int n; int q[N], tmp[N]; void merge_sort(int q[], int l, int r) { if (l >= r) return; int mid = l + r >> 1; merge_sort(q, l, mid); merge_sort(q, mid + 1, r); int k = 0, i = l, j = mid + 1; while (i <= mid && j <= r) { if (q[i] <= q[j]) tmp[k++] = q[i++]; else tmp[k++] = q[j++]; } while (i <= mid) tmp[k++] = q[i++]; while (j <= r) tmp[k++] = q[j++]; for (i = l, j = 0; i <= r; i++, j++) q[i] = tmp[j]; } int main() { scanf("%d", &n); for (int i = 0; i < n; i++) scanf("%d", &q[i]); merge_sort(q, 0, n - 1); for (int i = 0; i < n; i++) printf("%d ", q[i]); return 0; }
整数二分排序
(记得两种情况)
// 区间[l, r]被划分成[l, mid]和[mid + 1, r]时使用: int bsearch_1(int l, int r) { while (l < r) { • int mid = l + r >> 1; • if (check(mid)) r = mid; • else l = mid + 1; } return l; } // 区间[l, r]被划分成[l, mid - 1]和[mid, r]时使用: int bsearch_2(int l, int r) { while (l < r) { • int mid = l + r + 1 >> 1; • if (check(mid)) l = mid; • else r = mid - 1; } return l; }
例题(找到第一次出现和最后一次出现的位置)
#include <iostream> using namespace std; const int N = 100010; int n, m; int q[N]; int main() { // 输入数组长度 n 和查询次数 m scanf("%d%d", &n, &m); // 输入数组元素 for (int i = 0; i < n; i++) scanf("%d", &q[i]); // 对每个查询进行二分查找 while (m--) { • int x; • scanf("%d", &x); • // 找到第一个 x 出现的位置 • int l = 0, r = n - 1; • while (l < r) • { • int mid = l + r >> 1; • if (q[mid] >= x) r = mid; • else l = mid + 1; • } • // 如果数组中没有找到 x,输出 -1 -1 • if (q[l] != x) cout << "-1 -1" << endl; • else • { • cout << l << ' '; • // 找到最后一个 x 出现的位置 • int l = 0, r = n - 1; • while (l < r) • { • int mid = l + r + 1 >> 1; • if (q[mid] <= x) l = mid; • else r = mid - 1; • } • cout << l << endl; • } } return 0; }
小数二分排序
#include <iostream> using namespace std; int main() { double x; cin >> x; double l = a, r = x; while (r - l > 1e-6) { double mid = (l + r) / 2; if (mid * mid >= x) r = mid; else l = mid; } printf("%lf\n", l); return 0; }