选择排序（迭代

// 选择排序.cpp : 此文件包含 "main" 函数。程序执行将在此处开始并结束。
//

#include <iostream>
#define N 10
#define random(x,y) rand()%(x-y+1)+y //y到x的随机数
void SelectSort(int a[])
{
	for (int i = 0; i < N-1; i++)
	{
		int b = -1;
		for (int j = i + 1; j < N; j++)
		{
			if (a[i] > a[j])
			{
				b = a[i];
				a[i] = a[j];
				a[j] = b;
			}
		}

	}
}
int main()
{
	int a[N] = { 321,4,5,6,3,432,56,8234,234,54 };
	for (int i = 0; i < N; i++)
	{
		std::cout << a[i] << std::ends;
	}
	std::cout << std::endl;
	SelectSort(a);
	for (int i = 0; i < N; i++)
	{
		std::cout << a[i] << std::ends;
	}
}