选择排序算法

选择排序算法

#include <stdio.h>

int a[100000];

int main()
{
	int n, position = 0;

	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &a[i]);
	}

	for (int i = 0; i < n; i++)
	{
		int max = -999999, temp;
		for (int j = 0; j < n - i; j++)
		{
			if (a[j] > max)
			{
				max = a[j];
				position = j;
			}
		}
		temp = a[n - i - 1];
		a[n - i - 1] = max;
		a[position] = temp;
	}

	printf("%d", a[0]);
	for (int i = 1; i < n; i++)
	{
		printf(" %d", a[i]);
	}

	return 0;
}