1
#include <iostream>
2
using namespace std;
3
int a[10005];
4

5
void bubble_sort(int n)
6
{
7
    bool changed = true;
8
    while (changed)
9
    {
10
        changed = false;
11
        for (int i = 1; i < n; i++)
12
        {
13
            if (a[i] > a[i + 1])
14
            {
15
                swap(a[i], a[i + 1]);
16
                changed = true;
17
            }
18
        }
19
    }
20
}
21

22
int main()
23
{
24
    int n;
25
    cin >> n;
26
    for (int i = 1; i <= n; i++)
27
        cin >> a[i];
28
    bubble_sort(n);
29
    for (int i = 1; i <= n; i++)
30
        cout << a[i] << " ";
31
    return 0;
32
}

1
#include <iostream>
2
using namespace std;
3
int a[10005];
4

5
void bubble_sort(int n)
6
{
7
    bool changed = true;
8
    while (changed)
9
    {
10
        changed = false;
11
        for (int i = 1; i < n; i++)
12
        {
13
            if (a[i] < a[i + 1])
14
            {
15
                swap(a[i], a[i + 1]);
16
                changed = true;
17
            }
18
        }
19
    }
20
}
21

22
int main()
23
{
24
    int n;
25
    cin >> n;
26
    for (int i = 1; i <= n; i++)
27
        cin >> a[i];
28
    bubble_sort(n);
29
    for (int i = 1; i <= n; i++)
30
        cout << a[i] << " ";
31
    return 0;
32
}

1
#include <iostream>
2
using namespace std;
3
int a[10005];
4

5
void selection_sort(int n)
6
{
7
    for (int i = 1; i < n; i++)
8
    {
9
        int pos = i;
10
        for (int j = i + 1; j <= n; j++)
11
        {
12
            if (a[j] < a[pos])
13
                pos = j;
14
        }
15
        swap(a[i], a[pos]);
16
    }
17
}
18

19
int main()
20
{
21
    int n;
22
    cin >> n;
23
    for (int i = 1; i <= n; i++)
24
        cin >> a[i];
25
    selection_sort(n);
26
    for (int i = 1; i <= n; i++)
27
        cout << a[i] << " ";
28
    return 0;
29
}

1
#include <iostream>
2
using namespace std;
3
int a[10005];
4

5
void selection_sort(int n)
6
{
7
    for (int i = 1; i < n; i++)
8
    {
9
        int pos = i;
10
        for (int j = i + 1; j <= n; j++)
11
        {
12
            if (a[j] > a[pos])
13
                pos = j;
14
        }
15
        swap(a[i], a[pos]);
16
    }
17
}
18

19
int main()
20
{
21
    int n;
22
    cin >> n;
23
    for (int i = 1; i <= n; i++)
24
        cin >> a[i];
25
    selection_sort(n);
26
    for (int i = 1; i <= n; i++)
27
        cout << a[i] << " ";
28
    return 0;
29
}

1
#include <iostream>
2
using namespace std;
3
int a[10005];
4
void insertion_sort(int n) {
5
    for (int i = 1; i < n; ++i) {
6
        int key = a[i];
7
        int j = i - 1;
8
        while (j >= 0 && a[j] > key) {
9
            a[j + 1] = a[j];
10
            j--;
11
        }
12
        a[j + 1] = key;
13
    }
14
}
15
int main()
16
{
17
    int n;
18
    cin >> n;
19
    for (int i = 1; i <= n; i++)
20
        cin >> a[i];
21
    insertion_sort(n);
22
    for (int i = 1; i <= n; i++)
23
        cout << a[i] << " ";
24
    return 0;
25
}

1
#include <iostream>
2
using namespace std;
3
int a[10005];
4
void insertion_sort(int n) {
5
    for (int i = 1; i < n; ++i) {
6
        int key = a[i];
7
        int j = i - 1;
8
        while (j >= 0 && a[j] > key) {
9
            a[j + 1] = a[j];
10
            j--;
11
        }
12
        a[j + 1] = key;
13
    }
14
}
15
int main()
16
{
17
    int n;
18
    cin >> n;
19
    for (int i = 1; i <= n; i++)
20
        cin >> a[i];
21
    insertion_sort(n);
22
    for (int i = n; i >= 1; i++)
23
        cout << a[i] << " ";
24
    return 0;
25
}

1
#include <iostream>
2
using namespace std;
3
int a[10005];
4
int b[100005];
5

6
void counting_sort(int n)
7
{
8
    for (int i = 1; i <= n; i++)
9
        b[a[i]]++;
10
}
11

12
int main()
13
{
14
    int n, maxn = -1;
15
    cin >> n;
16
    for (int i = 1; i <= n; i++)
17
    {
18
        cin >> a[i];
19
        maxn = max(maxn, a[i]);
20
    }
21
    counting_sort(n);
22
    for (int i = 1; i <= maxn; i++)
23
        while (b[i]--)
24
            cout << i << " ";
25
    return 0;
26
}

1
#include <iostream>
2
using namespace std;
3
int a[10005];
4
int b[100005];
5

6
void counting_sort(int n)
7
{
8
    for (int i = 1; i <= n; i++)
9
        b[a[i]]++;
10
}
11

12
int main()
13
{
14
    int n, maxn = -1;
15
    cin >> n;
16
    for (int i = 1; i <= n; i++)
17
    {
18
        cin >> a[i];
19
        maxn = max(maxn, a[i]);
20
    }
21
    counting_sort(n);
22
    for (int i = maxn; i >= 1; i++)
23
        while (b[i]--)
24
            cout << i << " ";
25
    return 0;
26
}

1
#include <bits/stdc++.h>
2
using namespace std;
3
const int N = 1e5 + 5;
4
struct node
5
{
6
    int data;
7
    node *left, *right; // 左儿子和右儿子
8
};
9
void print(node *t) // 递归中序输出
10
{
11
    if (t == NULL)
12
        return;
13
    print(t->left);         // 左儿子
14
    cout << t->data << " "; // 输出
15
    print(t->right);        // 右儿子
16
}
17
int main()
18
{
19
    int n;
20
    cin >> n;
21
    int x;
22
    cin >> x;
23
    node *head = new node;
24
    head->data = x;
25
    head->left = NULL;
26
    head->right = NULL;
27
    for (int i = 2; i <= n; i++)
28
    {
29
        cin >> x;
30
        node *q = new node;
31
        q->data = x;
32
        q->left = NULL;
33
        q->right = NULL;
34
        node *p = head;
35
        while (p != NULL)
36
        {
37
            if (x <= p->data) // 小于等于就放到左儿子
38
            {
39
                if (p->left == NULL)
40
                {
41
                    p->left = q;
42
                    break;
43
                }
44
                else
45
                {
46
                    p = p->left;
47
                }
48
            }
49
            else // 大于就放到右儿子
50
            {
51
                if (p->right == NULL)
52
                {
53
                    p->right = q;
54
                    break;
55
                }
56
                else
57
                {
58
                    p = p->right;
59
                }
60
            }
61
        }
62
    }
63
    print(head); // 中序输出
64
    return 0;
65
}