选择排序算法

#include<iostream>
using namespace std;
#define  Type int 
#define  n 10
void select_sort(Type* arry,int m);
void main(){
	Type arry[n]={8,2,3,4,2,4,8,9,0,1};
	select_sort(arry,n);
	int i = 9;
	while(i >= 0){
		std::cout<<arry[9-i]<<std::endl;
		i--;
	}
}
void select_sort(Type* arry,int m){
	int minPos;
	for(int i = 0;i< m - 1;i++){
        minPos = i;
		for (int j = i + 1;j < m;j++)
		{
             if (*(arry+j) < *(arry+minPos))
             {
				 minPos = j;//记录最小值位置
             }
		}
		if (minPos != i)
		{
			swap(*(arry + i),*(arry + minPos));//交换
		}
	}
}