很简单的排序
// 简单的排序
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;
int main() {
int arr[1001];
int t, temp;
int n;
cin >> t;
while (t--) {
cin >> n;
for (int i = 0; i < n; ++i)
scanf("%d", &arr[i]);
for (int i = 0; i < n - 1; ++i) {
for (int j = n - 1; j > i; --j) {
if (arr[j] < arr[j - 1]) {
temp = arr[j];
arr[j] = arr[j - 1];
arr[j - 1] = temp;
}
}
}
for (int i = 0; i < n; ++i)
cout << arr[i] << endl;
}
return 0;
}