插入排序
//1:insertsort
template <typename T>
void InsertSort(T a[], int n)
{
for (int i = 1; i < n; i++)
{
T t = a[i];
int j = i - 1;
while (j >= 0 && t < a[j])
{
a[j + 1] = a[j];
j--;
}
a[j + 1] = t;
}
}
折半插入排序
//2:BinaryInsertSort
template <typename T>
void BinaryInsertSort(T a[], int n)
{
//l:low h:high m:mid
int l, h;
for (int i = 0; i < n; i++)
{
T t = a[i], l = 0, h = i - 1;
while (l <= h)
{
int m = (l + h) >> 1;
t < a[m] ? h = m - 1 : l = m + 1;
}
for (int j = i - 1; j >= h + 1; j--)
a[j + 1] = a[j];
a[h + 1] = t;
//a[l-1] = t;
}
}
希尔排序
//3:ShellSort
template <typename T>
void ShellSort(T a[], int n)
{
int k = n / 2;
while (k > 0)
{
//g: gap
for (int g = 0; g < n; g++)
{
for (int i = g + k; i < n; i += k)
{
T t = a[i];
int j = i - k;
while (j >= 0 && t < a[j])
{
a[j + k] = a[j];
j -= k;
}
a[j + k] = t;
}
}
k /= 2;
}
}
冒泡排序
//4:BubbleSort
template <typename T>
void BubbleSort(T a[], int n)
{
for (int i = n - 1; i > 0; i--)
{
int swaped = 1;
for (int j = 0; j < i; j++)
{
if (a[j] > a[j + 1])
{
swap(a[j], a[j + 1]);
swaped = 0;
}
}
if (swaped)
break;
}
}
快速排序
//5:QuickSort
template <typename T>
int Partition(T a[], int l, int r)
{
T t = a[l];
while (l < r)
{
while (l < r && a[r] >= t)
r--;
a[l] = a[r];
while (l < r && a[l] < t)
l++;
a[r] = a[l];
}
a[l] = t;
return l;
}
template <typename T>
void QuickSort(T a[], int l, int r)
{
if (l >= r)
return;
int pivotloc = Partition(a, l, r);
QuickSort(a, l, pivotloc - 1);
QuickSort(a, pivotloc + 1, r);
}
选择排序
//6:SelectSort
template <typename T>
// void SelectSort(T a[], int n)
// {
// for (int i = 0; i < n - 1; i++)
// for (int j = i + 1; j < n; j++)
// if (a[i] > a[j])
// swap(a[i], a[j]);
// }
void SelectSort(T a[], int n)
{
for (int i = 0; i < n - 1; i++)
{
int idx = i;
for (int j = i + 1; j < n; j++)
if (a[j] < a[idx])
idx = j;
if (i != idx)
swap(a[i], a[idx]);
}
}
堆排序
//7:HeapSort
template <typename T>
void heapify(T a[], int i, int n)
{
//c: child
if (i >= n)
return;
int c = 2 * i + 1;
int largest = i;
if (c + 1 < n && a[c] < a[c + 1])
c++;
if (c < n && a[largest] < a[c])
largest = c;
if (largest != i)
{
swap(a[i], a[largest]);
heapify(a, largest, n);
}
}
template <typename T>
void HeapSort(T a[], int n)
{
//build heap
for (int i = n / 2 - 1; i >= 0; i--)
heapify(a, i, n);
//arranging array
for (int i = n - 1; i >= 0; i--)
{
swap(a[0], a[i]);
heapify(a, 0, i);
}
}
归并排序
//8:MergeSort
template <typename T>
void Merge(T a[], int l, int m, int r)
{
//l: left r: right m: mid
//n1: length of left array
//n2: length of right array
int n1 = m - l + 1, n2 = r - m;
int L[n1], R[n2];
for (int i = 0; i < n1; i++)
L[i] = a[i + l];
for (int i = 0; i < n2; i++)
R[i] = a[i + m + 1];
int i = 0, j = 0, k = l;
while (i < n1 && j < n2)
{
if (L[i] <= R[j])
{
a[k] = L[i];
i++;
}
else
{
a[k] = R[j];
j++;
}
k++;
}
while (i < n1)
{
a[k] = L[i];
i++;
k++;
}
while (j < n1)
{
a[k] = R[j];
j++;
k++;
}
}
template <typename T>
void MergeSort(T a[], int l, int r)
{
if (l >= r)
return;
int m = (l + r - 1) >> 1;
MergeSort(a, 0, m);
MergeSort(a, m + 1, r);
Merge(a, l, m, r);
}
基数排序
//9:RadixSort
template <typename T>
void CountSort(T a[], int e, int n)
{
int o[n + 1], cnt[10] = {0};
for (int i = 0; i < n; i++)
cnt[(a[i] / e) % 10]++;
for (int i = 1; i < 10; i++)
cnt[i] += cnt[i - 1];
for (int i = n - 1; i >= 0; i--)
{
o[cnt[(a[i] / e) % 10]] = a[i];
cnt[(a[i] / e) % 10]--;
}
for (int i = 1; i <= n; i++)
a[i - 1] = o[i];
}
template <typename T>
void RadixSort(T a[], int n)
{
int m = *max_element(a, a + n);
for (int e = 1; m / e > 0; e *= 10)
CountSort(a, e, n);
}
睡眠排序
:)
完整代码
#include <stdio.h>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
//1:insertsort
template <typename T>
void InsertSort(T a[], int n)
{
for (int i = 1; i < n; i++)
{
T t = a[i];
int j = i - 1;
while (j >= 0 && t < a[j])
{
a[j + 1] = a[j];
j--;
}
a[j + 1] = t;
}
}
//2:BinaryInsertSort
template <typename T>
void BinaryInsertSort(T a[], int n)
{
//l:low h:high m:mid
int l, h;
for (int i = 0; i < n; i++)
{
T t = a[i], l = 0, h = i - 1;
while (l <= h)
{
int m = (l + h) >> 1;
t < a[m] ? h = m - 1 : l = m + 1;
}
for (int j = i - 1; j >= h + 1; j--)
a[j + 1] = a[j];
a[h + 1] = t;
//a[l-1] = t;
}
}
//3:ShellSort
template <typename T>
void ShellSort(T a[], int n)
{
int k = n / 2;
while (k > 0)
{
//g: gap
for (int g = 0; g < n; g++)
{
for (int i = g + k; i < n; i += k)
{
T t = a[i];
int j = i - k;
while (j >= 0 && t < a[j])
{
a[j + k] = a[j];
j -= k;
}
a[j + k] = t;
}
}
k /= 2;
}
}
//4:BubbleSort
template <typename T>
void BubbleSort(T a[], int n)
{
for (int i = n - 1; i > 0; i--)
{
int swaped = 1;
for (int j = 0; j < i; j++)
{
if (a[j] > a[j + 1])
{
swap(a[j], a[j + 1]);
swaped = 0;
}
}
if (swaped)
break;
}
}
//5:QuickSort
template <typename T>
int Partition(T a[], int l, int r)
{
T t = a[l];
while (l < r)
{
while (l < r && a[r] >= t)
r--;
a[l] = a[r];
while (l < r && a[l] < t)
l++;
a[r] = a[l];
}
a[l] = t;
return l;
}
template <typename T>
void QuickSort(T a[], int l, int r)
{
if (l >= r)
return;
int pivotloc = Partition(a, l, r);
QuickSort(a, l, pivotloc - 1);
QuickSort(a, pivotloc + 1, r);
}
//6:SelectSort
template <typename T>
// void SelectSort(T a[], int n)
// {
// for (int i = 0; i < n - 1; i++)
// for (int j = i + 1; j < n; j++)
// if (a[i] > a[j])
// swap(a[i], a[j]);
// }
void SelectSort(T a[], int n)
{
for (int i = 0; i < n - 1; i++)
{
int idx = i;
for (int j = i + 1; j < n; j++)
if (a[j] < a[idx])
idx = j;
if (i != idx)
swap(a[i], a[idx]);
}
}
//7:HeapSort
template <typename T>
void heapify(T a[], int i, int n)
{
//c: child
if (i >= n)
return;
int c = 2 * i + 1;
int largest = i;
if (c + 1 < n && a[c] < a[c + 1])
c++;
if (c < n && a[largest] < a[c])
largest = c;
if (largest != i)
{
swap(a[i], a[largest]);
heapify(a, largest, n);
}
}
template <typename T>
void HeapSort(T a[], int n)
{
//build heap
for (int i = n / 2 - 1; i >= 0; i--)
heapify(a, i, n);
//arranging array
for (int i = n - 1; i >= 0; i--)
{
swap(a[0], a[i]);
heapify(a, 0, i);
}
}
//8:MergeSort
template <typename T>
void Merge(T a[], int l, int m, int r)
{
//l: left r: right m: mid
//n1: length of left array
//n2: length of right array
int n1 = m - l + 1, n2 = r - m;
int L[n1], R[n2];
for (int i = 0; i < n1; i++)
L[i] = a[i + l];
for (int i = 0; i < n2; i++)
R[i] = a[i + m + 1];
int i = 0, j = 0, k = l;
while (i < n1 && j < n2)
{
if (L[i] <= R[j])
{
a[k] = L[i];
i++;
}
else
{
a[k] = R[j];
j++;
}
k++;
}
while (i < n1)
{
a[k] = L[i];
i++;
k++;
}
while (j < n1)
{
a[k] = R[j];
j++;
k++;
}
}
template <typename T>
void MergeSort(T a[], int l, int r)
{
if (l >= r)
return;
int m = (l + r) >> 1;
MergeSort(a, 0, m);
MergeSort(a, m + 1, r);
Merge(a, l, m, r);
}
//9:RadixSort
template <typename T>
void CountSort(T a[], int e, int n)
{
int o[n + 1], cnt[10] = {0};
for (int i = 0; i < n; i++)
cnt[(a[i] / e) % 10]++;
for (int i = 1; i < 10; i++)
cnt[i] += cnt[i - 1];
for (int i = n - 1; i >= 0; i--)
{
o[cnt[(a[i] / e) % 10]] = a[i];
cnt[(a[i] / e) % 10]--;
}
for (int i = 1; i <= n; i++)
a[i - 1] = o[i];
}
template <typename T>
void RadixSort(T a[], int n)
{
int m = *max_element(a, a + n);
for (int e = 1; m / e > 0; e *= 10)
CountSort(a, e, n);
}
int main()
{
int a[1 << 10], n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
// InsertSort(a, n);
// BinaryInsertSort(a, n);
// BubbleSort(a, n);
// QuickSort(a, 0, n - 1);
// SelectSort(a, n);
// HeapSort(a, n);
// MergeSort(a, 0, n - 1);
// RadixSort(a, n);
for (int i = 0; i < n; i++)
printf("%d ", a[i]);
return 0;
}
(测试数据坐上来自己动)