简单选择排序的改进——二元选择排序

void print(int a[],int n,int i){
cout<<"第"<<i+1<<"趟:";
for(int j=0;j<n;j++){
cout<<a[j]<<" ";
}
cout<<endl;
}

void SelectSort(int a[],int n){
int min,max,minTmp,maxTmp;
for(int i=0;i<n/2;i++){
min = i;
max = i;
for(int j= i+ 1;j<n-i;j++){
if(a[j] > a[max]){
max = j;
continue;
}
if(a[j] < a[min]){
min = j;
}
}
//做数据交换，注意分情况讨论
minTmp = a[min];
maxTmp = a[max];
if(i == max && n-i-1 == min){


}else if(i == max){
a[min] = a[n-i-1];
}else if(n-i-1 == min){
a[max] = a[i];
}else{
a[min] = a[i];
a[max] = a[n-i-1];
}
a[i] = minTmp;
a[n-i-1] = maxTmp;


print(a,n,i);
}

}

void main()
{
int a[8] = { 9,2,4,1,8,3,7,0};
SelectSort(a,8);
}