插入排序
时间算法度: Θ ( n 2 ) Θ\left(n^2\right) Θ(n2)
该算法主旨:
从数组的第二个元素开始,跟前面的元素比较,如果前面的元素大于它,则交换两个元素的位置,直到遇见小于它的元素则停止。如此循环直到排完序。
伪代码:
INSERTION-SORT(A)
1 for j = 2 to A.length
2 key = A[j]
3 i = j - 1
4 while i > 0 && A[i] > key
5 A[i + 1] = A[i]
6 i = i - 1
7 A[i + 1] = key
C++代码:
void INSERTION_SORT(int *A, int length)
{
for (int j = 1; j < length; j++)
{
int key = A[j];
int i = j - 1;
while (i >= 0 && A[i] > key)
{
A[i + 1] = A[i];
i--;
}
A[i + 1] = key;
}
}
测试代码:
#include <iostream>
constexpr std::size_t N = 10;
// 声明插入排序函数
void INSERTION_SORT(int *A, int length);
int main(void)
{
int A[N]{ 3, 2, 5, 3, 7, 1, 8, 0, 9, 4 };
INSERTION_SORT(A, N);
for (int a : A)
std::cout << a << " ";
std::cout << std::endl;
return 0;
}
// 定义插入排序函数
void INSERTION_SORT(int *A, int length)
{
for (int j = 1; j < length; j++)
{
int key = A[j];
int i = j - 1;
while (i >= 0 && A[i] > key)
{
A[i + 1] = A[i];
i--;
}
A[i + 1] = key;
}
}
/* —————————————————————————————————————————————————————
* 输出结果:
* 0 1 2 3 3 4 5 7 8 9
* —————————————————————————————————————————————————————— */