STLAlgorithm的介绍(1)


STLAlgorithm的介绍(1)

library
<algorithm>

<algorithm>

Standard Template Library: Algorithms

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

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



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 <algorithm>

Non-modifying sequence operations:



Modifying sequence operations:



Partitions:



Sorting:



Binary search (operating on partitioned/sorted ranges):



Merge (operating on sorted ranges):



Heap:



Min/max:



Other:



发表回复

您的邮箱地址不会被公开。 必填项已用 * 标注