c++STL中的sort()函数能对链表进行排序吗？

2025-02-22 09:09:06

推荐回答（4个）

回答1：

sort函数的两个参数是迭代器，另外一个回调函数或仿函数可以自己定义。
#include

template
void sort( RandomAccessIterator start, RandomAccessIterator end );

template
void sort( RandomAccessIterator start, RandomAccessIterator end, Compare cmp );

//************

The sort algorithm sorts the elements in the range [start,end) into ascending order. If two elements are equal, there is no guarantee what order they will be in.

If the function object cmp is given, then it will be used to compare two objects instead of the < operator. cmp should induce a strict weak ordering on the values from start to end.

Note that sort will only work with RandomAccessIterators. For example, you cannot use sort on the iterators of a list; you should use list::sort instead.

Parameters
start and end are RandomAccessIterators pointing to the range of elements to be sorted.

cmp is an optional function object that is used in place of < to perform comparisons between pairs of elements