DS sort -- quick sort

Title Description

Give a data sequence , Use the quick sort algorithm to sort from small to large

-- Procedural requirements --

If you use C++ Can only include A header file iostream; If you use C Language can only include A header file stdio

If in the program include More than one header file , Don't look at the code , do 0 Sub processing

It is not allowed to use third-party objects or functions to realize the requirements of this topic

Input

First line input t, Express t Test examples
Second line input n, Indicates that the first example has n Data
In the third line, enter n Data , Positive integers , Space between data
And so on

Output

Each group of test data , Output the result of each fast queue , That is, arrange one number at a time （ The length is 1 The subsequence , No row , No output ）. Separate different test data with blank lines .

   The sample input

2
6
111 22 6 444 333 55
8
77 555 33 1 444 77 666 2222

Sample output

55 22 6 111 333 444
6 22 55 111 333 444
6 22 55 111 333 444
6 22 55 111 333 444

1 33 77 555 444 77 666 2222
1 33 77 555 444 77 666 2222
1 33 77 77 444 555 666 2222
1 33 77 77 444 555 666 2222
1 33 77 77 444 555 666 2222

Code

#include "iostream"
using namespace std;
const int maxn=1e5+20;
int t,n,a[maxn];

void display(){
    for(int i=1;i<=n;i++){
        if(i!=1) cout<<" ";
        cout<<a[i];
    }
    cout<<endl;
}

void qisort(int ll,int rr){
    if(ll>=rr) return;
    int l=ll,r=rr;
    int res=a[l];
    while(l<r){
        while(r>l && a[r]>=res) r--;
        if(a[r]<res) a[l]=a[r],l++;
        while(l<r && a[l]<=res) l++;
        if(a[l]>res) a[r]=a[l],r--;
    }
    a[l]=res;
    display();
    qisort(ll,l-1);
    qisort(l+1,rr);
}

int main(){
//    freopen("123.in","r",stdin);
    cin>>t;
    while(t--){
        cin>>n;
        for(int i=1;i<=n;i++){
            cin>>a[i];
        }
        qisort(1,n);
        cout<<endl;
    }
    return 0;
}