#include<iostream>
using namespace std;
int main(){
int a[11];
int i;
int j;
int t;
cout << "input 10 numbers:" << endl;
for (i = 1; i < 11; i++)
cin >> a[i];
cout << endl;
for (j = 1; j <= 9; j++)//总共10个数进行9趟比较
for (i = 1; i <= 10 - j; i++)//每趟要进行(10-j)次两两比较
if (a[i]>a[i + 1])//如果前面的数大于后面的数,交换两个数的位置,使小数上浮
{
t = a[i]; a[i] = a[i + 1]; a[i + 1] = t;
}
cout << "the sorted numbers: " << endl;//输出10个数
for (i = 1; i < 11; i++)
cout << a[i] << " ";
cout << endl;
return 0;
}
选择法就是先将10个数中最小的数与a[0]兑换,再将a[1]到a[9]中的最小的数与a[1]兑换,,,,,每比较一轮找出一个未经排序的数中最小的一个。共要九轮
//例5.7用选择法对数组中的10个整数按照由大到小排序 用数组名作为函数参数
#include<iostream>
using namespace std;
int main()
{
void select_sort(int array[], int n);
int a[10], i;
cout << "enter the original array:" << endl;
for (i = 0; i < 10; i++)
cin >> a[i];
cout << endl;
select_sort(a, 10);//数组调用,数组名作为实参
cout << "the sorted array:" << endl;
for (i = 0; i < 10; i++)
cout << a[i] << " ";
cout << endl;
return 0;
}
void select_sort(int array[], int n)
{
int i, j, k, t;
for (i = 0; i < n - 1; i++)
{
k = i;
for (j = i + 1; j < n;j++)
if (array[j] < array[k])
k = j;
t = array[k];
array[k] = array[i];
array[i] = t;
}
}