c_cpp 冒泡排序

Posted 2021-05-14

#include <bits/stdc++.h>
using namespace std;

//  #Sorting #Theory

void swap(int &x,int &y){
    int t=x;
    x=y;
    y=t;
}
void BubbleSort(vector<int> &a){    // passing vector by reference
    int n=a.size();
    for(int i=0;i<n;i++){	// to run swap loop for n times
        for(int j=0;j<n-1;j++){	// x=0 to x=n-2
            if(a[j]>a[j+1]){
                swap(a[j],a[j+1]);
            }
        }
    }
}

int main(){
    int t;
    cin>>t;
    while(t--){
        int n;
        cin>>n;
        vector<int> a(n);
        for(int i=0;i<n;i++){
            cin>>a[i];
        }
        cout<<"Original: ";
        for(int i=0;i<n;i++){
            cout<<a[i]<<" ";
        }
        cout<<endl;
        BubbleSort(a);
        cout<<"Sorted: ";
        for(int i=0;i<n;i++){
            cout<<a[i]<<" ";
        }
        cout<<endl;
        
    }
    
    return 0;
}