用选择排序法降序输出数组
定义一个函数,实现排序功能,注意下标不要出错
代码实现:
#include<iostream>//使用指针对数组中各元素进行排序
using namespace std;
void order (int *ipointer,int n);
void order (int *ipointer,int n)
//void order(int ipointer[],int n) //it also can perform the same function.
{
int i,j,k;
for(i=0;i<n-1;i++)
{
k=i;
for(j=i+1;j<n;j++)
{
if(*(ipointer+k)<*(ipointer+j))//取值就可以比较了
k=j;
}
if(k)
{
int temp=*(ipointer+k);
*(ipointer+k)=*(ipointer+i);
*(ipointer+i)=temp;
}
}
}
int main()
{
int narray[10]={1,2,3,4,5,6,7,8,9,10};
order(narray,10);
cout<<"排序后的数组"<<endl;
for(int i=0;i<10;i++)
{
cout<<narray[i]<<" ";
}
return 0;
}