排序算法-選擇排序

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
using namespace std;

void slect_sort(int *ary,int n)
{
	int i=0;
	int j = 0;
	int min = 0;
	for ( i = 0; i < n; i++)
	{
		min = i;
		for ( j = i+1; j < n; j++)
		{
			if (ary[min]>ary[j])
			{
				int tmp = ary[min];
				 ary[min] = ary[j];
				 ary[j] = tmp;
			} 
		}
	}
}
void main()
{
	int ary[] ={ 12,85,4,6,8,456,23,41 };
	printf("%d",sizeof(ary) / sizeof(int));
	for (int i = 0; i < sizeof(ary) / sizeof(int); i++)
	{
		printf("%d ",ary[i]);
		
	}
	printf("\n排序之前\n ");
	slect_sort(ary,sizeof(ary)/sizeof(int));
	for (int i = 0; i < sizeof(ary) / sizeof(int); i++)
	{
		printf("%d ", ary[i]);
	
	}
	printf("\n排序之後 \n");
	system("pause");
}