关于sort()的疑问

学术版

@[Micro_Seven](/user/291358) 不谢
by yaoyunhan181 @ 2019-12-16 12:16:27


@[hly1204](/user/242973) 请问左闭右开区间是什么啊
by nkinclude @ 2019-12-16 12:30:58


```cpp sort(_RandomAccessIterator __first, _RandomAccessIterator __last) { void std::sort<...>(__gnu_cxx::__normal_iterator<...>, __gnu_cxx::__normal_iterator<...>) +2 overloads @[brief](/user/285695) Sort the elements of a sequence. @ingroup sorting_algorithms @param __first An iterator. @param __last Another iterator. @return Nothing. Sorts the elements in the range @p [__first,__last) in ascending order, such that for each iterator @e i in the range @p [__first,__last-1), *(i+1)<*i is false. The relative ordering of equivalent elements is not preserved, use @p stable_sort() if this is needed. ```
by Cloudflare @ 2019-12-16 12:41:27


@[nkinclude](/user/186182) >$不会的题先百度$ > >```百度一下,你就知道``` > >----$Oier$行动守则 ------------------- $Let's $ $Baidu! $ - [全球最大的中文搜索引擎、致力于让网民更便捷地获取信息,找到所求。百度超过千亿的中文网页数据库,可以瞬间找到相关的搜索结果。 ](https://www.baidu.com/) - [1百度_百度百科](https://baike.baidu.com/item/%E7%99%BE%E5%BA%A6/6699#viewPageContent) - [2百度_百度百科](https://baike.baidu.com/item/%E7%99%BE%E5%BA%A6/22343833#viewPageContent) - [3百度_百度百科](hhttps://baike.baidu.com/item/%E7%99%BE%E5%BA%A6/23566127#viewPageContent) ---------- > [区间](https://baike.baidu.com/item/区间/1273117?fr=aladdin#3) > >$$ -- 百度 $$ ------------ $[a,b]$ 为闭区间 ``` [0,10]={0,1,2,3,4,5,6,7,8,9,10} ``` --------- $(a,b)$ 为开区间 ``` (0,10)={1,2,3,4,5,6,7,8,9} ``` ----------- $[a,b)$是左闭右开的 ``` [0,10)={0,1,2,3,4,5,6,7,8,9} ``` ```cpp //[a,b)相当于 for (int i=a;i<b;i++); ```
by jijidawang @ 2019-12-16 20:00:52


上一页 |