1061简单随机排序

//注意格式，最后的Result是以,分割的。#include<iostream>using namespace std;int main(){int n;cin>>n;int i,j;int *a=new int[n];for(i=0;i<n;i++){cin>>a[i];}cout<<"Source:"<<endl;cout<<"(";cout<<a[0];for(i=1;i<n;i++)cout<<" "<<a[i];cout<<")"<<endl;int m,t,k;cout<<"Select Sort:"<<endl;for(i=0;i<n;i++){m=i;for(j=i+1;j<n;j++){if(a[j]<a[m])m=j;}t=a[m];a[m]=a[i];a[i]=t;if(i==n-1)break;cout<<"("<<a[0];for(k=1;k<=i;k++)cout<<" "<<a[k];cout<<")";for(k=i+1;k<n;k++)cout<<" "<<a[k];cout<<endl;}cout<<"Result:"<<endl;cout<<"("<<a[0];for(k=1;k<n;k++)cout<<","<<a[k];cout<<")"<<endl;delete []a;return 0;}