1 .功能:按算法对deque容器进行排序
2 .算法:迭代器begin,迭代器结束(sort ); 对begin和end区间元素进行排序
# include iostream # include deque # includealgorithmusingnamespacestd; voidprintdeque(dequeintd ) for ) deque int :3360 iterator it=d.begin ); 信息技术!=d.end (; it ) cout*it '; coutendl; }void test1 () {dequeint d; d.push_back(10 ); d.push_back(40 ); d.push_back(30 ); d.push_back(54 ); d.push_back(5); d.push_back(28 ); printdeque(d ); //10 40 30 54 5 28 //sort排序。 对于默认按从小到大顺序支持//随机接入迭代器的容器,可以通过sort算法直接对其排序,也可以通过sort对//vector容器进行排序(d.begin )、D printdeque(d ); //5 10 28 30 40 54 }int main () ) {test1; 返回0; }