void xf_Swap(int& x, int& y)
{
int temp = x;
x = y;
y = temp;
}
/*
* 简单选择排序
*/
#include<iostream>
using namespace std;
int main()
{
int num[10] = {9,8,10,3,5,6,4,7,2,1};
cout<<"排序前:"<<endl;
for (int m = 0;m < 10;m++)
{
cout<<num[m]<<" ";
}
for (int i = 0;i < 9;i++)
{
int pos = i;
for (int j = i+1;j < 10;j++)
{
if (num[pos] > num[j])
{
......
阅读全文