数组倒置排序c++

#include <bits/stdc++.h>
using namespace std; 
int liuziyu(int num) {
    int a = 0;
    while (num > 0) {
        a = a * 10 + num % 10;
        num /= 10;
    }
    return a;
}

void maopao(int arr[], int n) {
    for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < n - i - 1; j++) {
         
            if (liuziyu(arr[j]) > liuziyu(arr[j + 1])) {
                int temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }
}

int main() {
    int N;
    cin>> N;

    for (int k = 0; k < N; ++k) {
        int n;
        cin >> n;

        int arr[n];
        for (int i = 0; i < n; ++i) {
            cin >> arr[i];
        }

       maopao(arr, n);

        for (int i = 0; i < n; ++i) {
           cout << arr[i] << " ";
        }
        cout << endl;
    }

    return 0;
}