选择排序
代码
#include <iostream>
typedef int ElementType;
using namespace std;
long *arr;
int N;
void Selection_Sort()
{
for(int j=N;j>0;j--)
{
int max_idx=0;
for(int i=0;i<j;i++)
{
if(arr[max_idx]<arr[i])
{
max_idx=i;
}
}
swap(arr[j-1],arr[max_idx]);
}
}
int main()
{
cin>>N;
arr=(long *)malloc(sizeof(long)*N);
for(int i=0;i<N;i++)
{
cin>>arr[i];
}
Selection_Sort();
for(int i=0;i<N;i++)
{
cout<<arr[i]<<" ";
}
system("pause");
return 0;
}