插入排序
#include<iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++)
cin >> a[i];
int key;
for (int j = 1; j < N; j++)
{
key = a[j];
int i = j - 1;
while (i >= 0 && a[i] > key)
{
a[i + 1] = a[i];
i = i - 1;
}
a[i + 1] = key;
}
for (int i = 0; i < N; i++)
cout << a[i] << " ";
}
#include<iostream>
using namespace std;
int main()
{
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++)
cin >> a[i];
int key;
for (int j = 1; j < N; j++)
{
key = a[j];
int i = j - 1;
while (i >= 0 && a[i] < key)
{
a[i + 1] = a[i];
i = i - 1;
}
a[i + 1] = key;
}
for (int i = 0; i < N; i++)
cout << a[i] << " ";
}