Hexo
0%

直插排序

Posted on In , ,
Symbols count in article: 767 Reading time ≈ 1 mins. 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
/*
 * @Author: CrayonXiaoxin
 * @Date: 2023-12-13 20:31:58
 * @LastEditors: Do not edit
 * @LastEditTime: 2023-12-20 19:47:20
 * @FilePath: \c++\code\C.cpp
 */
#include<iostream>
using namespace std;
#define ll long long int
const int maxn = 2e5+10;
int a[maxn];
int n;
void solve()
{
    for (int i = 0; i < n;++i)
        cin >> a[i];
    for (int i = 1; i < n;++i)
    {
        int tem = a[i];
        int now = i;
        while(now>=1)
        {
            if(a[now-1]>tem)
            {
                a[now] = a[now-1];
                now--;
            }
            else
            {
                break;
            }
        }

        a[now] = tem;
        for (int i = 0; i < n;++i)
        {
            cout << a[i] << " ";
        }
        cout << "\n";
    }
}

int main()
{
    // ios::sync_with_stdio(false);
    // cin.tie(0);
    // cout.tie(0);
    while(cin>>n)
        solve();
        return 0;
}