选择排序（C++实现）

#include
using namespace std;

void SelectSort(int* p, const int& n)
{
	for (int i = 0; i < n; i++)
	{
		int min = p[i];
		int pos = i;
		for (int j = i + 1; j < n; j++)
		{
			if (p[j] < min)
			{
				min = p[j];
				pos = j;
			}
		}
		int temp = p[i];
		p[i] = min;
		p[pos] = temp;
	}
}

int main(void)
{
	int num;
	cout<< "请输入数组元素的个数：";
	cin >> num;
	int* p = new int[num];
	cout << "请逐一输入数组元素：";
	for (int i = 0; i < num; i++)
	{
		cin >> p[i];
	}
	SelectSort(p, num);
	cout << "排序后的结果如下：" << endl;
	for (int i = 0; i < num; i++)
	{
		cout << p[i] << " ";
	}
	cout << endl;
	return 0;
}