简单选择排序

# include <iostream>

using namespace std;
//升序
void SimpleSort(int *a,int n);

int main(){

int a[]={1,65,89,-5,6,-569};

SimpleSort(a,6);
for(int i=0;i<6;i++){
cout<<a[i]<<"  ";
}
cout<<endl;

return 0;
}

void SimpleSort(int *a,int n){

int i,j,k,t;

for(i=0;i<n-1;i++){
k = i;
for(j=i+1;j<n;j++)
if(a[j]<a[k]) k = j;
t = a[i];
a[i] = a[k];
a[k] = t;
}
}