/*-----------------升序排列-------------------*/
#include <iostream>
using namespace std;
{
int arr[]= {
9,8,7,6,5,4,3,2,1};
int temp;
cout << "排序前arr数组为:"<<endl;
for (auto a : arr)
{
cout << a << ends;
}
cout << endl;
for (size_t i = 0; i < sizeof(arr)/4; i++)
{
for ( int j = i+1; j <sizeof(arr)/4; j++)
{
//将第i个数字与i+j的数字依次比较互换。
if (arr[i]>arr[j]) //将大的数字依次放到后面,小的数字放到前面,完成升序排列.
{
temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
}
cout << "排序完成后arr数组为:" << endl;
for (auto a:arr)
{
cout << a << ends;
}
}
/*------------------降序排列-------------------------*/
#include <iostream>
using namespace std;
int main()
{
int arr[]= {
1,2