STL Algorithm的介绍(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:



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值