STL Algorithm的介绍(1)

原文地址:http://www.cplusplus.com/reference/algorithm/
library

Standard Template Library: Algorithms

The header  defines a collection of functions especially designed to be used on ranges of elements.

头文件定义了集合的算法,特别是范围内的元素的算法。


A range is any sequence of objects that can be accessed through iterators or pointers, such as an array or an instance of some of the STL containers. Notice though, that algorithms operate through iterators directly on the values, not affecting in any way the structure of any possible container (it never affects the size or storage allocation of the container).

一个范围是指一个能够通过迭代器或者指针访问的序列容器,例如一个数组或者是STL containers的一个实例。需要注意的是,algorithm直接通过迭代器操作值,不会以任何方式影响容器的结构。(不会影响其大小或者内存分配)


Functions in

Non-modifying sequence operations:

Find eleme

nt in range (function template )


Modifying sequence operations:

Partitions:

Sorting:

Binary search (operating on partitioned/sorted ranges):

Merge (operating on sorted ranges):

Heap:

Min/max:

Other:

Transform range to previous permutation (function template )




//翻译的不好的地方请多多指导,可以在下面留言或者点击左上方邮件地址给我发邮件,指出我的错误以及不足,以便我修改,更好的分享给大家,谢谢。

转载请注明出处:http://blog.csdn.net/qq844352155

2014-8-19

于GDUT


你可能感兴趣的:(STL,算法,STL,算法,STL,c++11)