c_cpp 选择排序

Posted 2021-05-14

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

//  #Sorting #Theory

void SelectionSort(vector<int> &a){    // passing vector by reference
    int n=a.size();
    for(int i=0;i<n-1;i++){     // x=0 to x=n-2 as single/right most element is already sorted 
       int min=INT_MAX;
        int minInd=-1;
        for(int j=i;j<n;j++){
            if(a[j] < min){
                min=a[j];
                minInd=j;
            }
        }
        swap(a[i],a[minInd]);
    }
}

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;
        SelectionSort(a);
        cout<<"Sorted: ";
        for(int i=0;i<n;i++){
            cout<<a[i]<<" ";
        }
        cout<<endl;
        
    }
    
    return 0;
}