题解 | #牛牛的排序#

#include <iostream>
using namespace std;

void sort(int *array, int n)
{
    for (int *i = array; i != array + n - 1; ++i)
    {
        for (int *j = i + 1; j != array + n; ++j)
        {
            if (*i > *j)
            {
                int temp = *i;
                *i = *j;
                *j = temp;
            }
        }
    }
}
int main() {
    int n;
    cin >> n;
    int a[n];
    for (int i = 0; i < n; ++i)
        cin >> a[i];
    sort(a, n);
    for (int i = 0; i < n; ++i)
        cout << a[i] << " ";
}
// 64 位输出请用 printf("%lld")

简单地写个选择排序