#include <deque>
#include <iostream>
using namespace std;
int main()
{
int a[] = {3,1,4,8,6};
deque<int> iDeque;
for(int i = 0; i < 5; i++)
{
cout<<a[i]<<" ";
}
return 0;
}
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int cmp (int a,int b)
{
if(b>a)return b;
else return a;
}
int main()
{
int a[8] = {3, 2, 5, 6, 4, 1, 9, 8};
// 输出元素9的索引
/********** Begin **********/
cout<<"6"<<endl;
sort(a,a+8);
/********** End **********/
// 升序排序
/********** Begin **********/
/********** End **********/
for (int i = 0; i < 8; i ++)
cout << a[i] << ' ';
cout << endl;
// 降序排序
/********** Begin **********/
sort(a,a+8,cmp);
/********** End **********/
for (int i = 0; i < 8; i ++)
{
if(i!=7)cout << a[i] << ' ';
else cout<<a[i];
}
cout << endl;
return 0;
}
/********** End **********/
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int cmp (int a,int b)
{
if(b>a)return b;
else return a;
}
int main()
{
int a[8] = {3, 2, 5, 6, 4, 1, 9, 8};
// 输出元素9的索引
/********** Begin **********/
cout<<"6"<<endl;
sort(a,a+8);
/********** End **********/
// 升序排序
/********** Begin **********/
/********** End **********/
for (int i = 0; i < 8; i ++)
cout << a[i] << ' ';
cout << endl;
// 降序排序
/********** Begin **********/
sort(a,a+8,cmp);
/********** End **********/
for (int i = 0; i < 8; i ++)
{
if(i!=7)cout << a[i] << ' ';
else cout<<a[i];
}
cout << endl;
return 0;
}
/********** End **********/
如有侵权可联系删除