冒泡排序o(n^2)
// 冒泡排序
void Bubble(int n, int* a)
{
for (int i = 1; i <= n - 1; i++) //排序轮数 n - 1
{
for (int j = 1; j <= n - i; j++)
{
if (a[j] > a[j + 1]) { //冒泡排序:大元素下沉
swap(a[j], a[j + 1]);
}
}
}
}
选择排序o(n^2)
//选择排序
void Selection(int n, int* a)
{
for (int i = 1; i <= n - 1; i++) //排序轮数 n - 1
{
int key = i;//key:未排序最小值下标
for (int j = i + 1; j <= n; j++)
{
if (a[j] < a[key]) { //更新未排序最小值下标
key = j;
}
}
if (i != key){
swap(a[i], a[key]);
}
}
}
插入排序o(n^2)
void Insert(int n, int* a)
{
for (int i = 2; i <= n; i++)
{
int key = a[i]; //待插入元素
int j = i - 1;
while (j >= 1 && a[j] > key) //寻找合适的位置
{
a[j + 1] = a[j];
j--;
}
a[j + 1] = key;//找到位置并插入
}
}
快速排序 (非稳定排序算法平均o(n log n) 最坏o(n^2))
void Quick(int l, int r, int* a)
{
int x = l, y = r, mid = a[(l + r) / 2]; //选取中间值为快排基准值
while (x <= y)
{
while (a[x] < mid) x++;//从左侧找第一个不小于mid的值
while (a[y] > mid) y--;//从右侧找第一个不大于mid的值
if (x <= y) {
swap(a[x], a[y]);//交换
x++; y--;
}
}
if (x < r) Quick(x, r, a);
if (y > l) Quick(l, y, a);
}
归并排序o(n log n)
int c[N];
void Merge(int b, int e, int* a)
{
if (b == e) return;
int mid = (b + e) / 2, i = b, j = mid + 1, k = b;
Merge(i, mid, a), Merge(j, e, a);//区间分解
//区间合并
while (i <= mid && j <= e)
{
if (a[i] <= a[j]) {
c[k++] = a[i++];
}
else
c[k++] = a[j++];
}
while (i <= mid)
c[k++] = a[i++];
while (j <= e)
c[k++] = a[j++];
for (int l = b; l <= e; l++)
a[l] = c[l];
}