插入排序的思路就是一个一个排序
伪代码:将数组中小的数字往前移
(A,N)//有N个元素的数组A
for i从1到N-1 包含N-1
v=A[i]
j=i-1
while j>=0且A[j]>v
A[j+1]=A[j]
j--
A[j+1]=v
代码如下:
#include <iostream>
using namespace std;
int main()
{
int n, a[127];
int v, j;
cout << "请输入数组的长度:";
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++)
{
v = a[i];
j = i - 1;
while (j >= 0 && a[j] > v)
{
a[j + 1] = a[j];
j--;
}
a[j + 1] = v;
for (int k = 0; k < n; k++)
{
if (k != 0)
cout << " "; //这里是为了不让末尾有空格
cout << a[k];
}
cout << endl;
}
return 0;
}
冒泡排序类似于水中气泡往上浮轻的往上
代码
int main()
{
int sw = 0;
int n, a[127];
int v, j;
cout << "请输入数组的长度:";
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
{
for(int j=n-1;j>=i+1;j--)
if (a[j] < a[j - 1])
{
swap(a[j], a[j - 1]);
sw++;
}
for (int k = 0; k < n; k++)
{
if (k > 0)
cout << " ";
cout << a[k];
}
cout << endl;
}
cout << sw << endl;
return 0;
}
选择排序:每次找到未排序中的最小的数的下标
代码:
#include <iostream>
using namespace std;
int main()
{
int swp = 0;
int n, a[100];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
{
int minj = i;
for (int j = i; j <=n - 1; j++)
if (a[j] < a[minj])
minj = j;
if (i != minj) {
swap(a[i], a[minj]);
swp++;
}
}
for (int i = 0; i < n; i++)
{
if (i > 0)
cout << " ";
cout << a[i];
}
cout << endl;
cout << swp << endl;
return 0;
}