选择排序 - mobai_dalao

//冒泡排序
#include<iostream>
#include<cstdlib>

using namespace std;

void SelectSort(int *a, int n)
{
	int k,temp;
	for (int i = 0; i < n; i++)
	{
		k = i;
		for (int j = i + 1; j < n; j++)
			if (a[k] > a[j])
				k = j;
		temp = a[k];
		a[k] = a[i];
		a[i] = temp;
	}
}

int main()
{
	int a[10] = { 3,5,9,8,0,1,2,7,6,6 };
	int n = 10;
	for (int i = 0; i < 10; i++)
		cout << a[i] << " ";
	cout << endl;
	SelectSort(a, n);
	for (int i = 0; i < 10; i++)
		cout << a[i] << " ";

	system("pause");
	return 0;
}

选择排序思想为每次从数组中选择一个最小的放在数组前面，再从剩下的元素中接着找最小的放在第二个位置，依次完成排序