官术网_书友最值得收藏!

Merges and mergesort

As long as we're on the topic of sorting algorithms, let's write sort a different way!

std::inplace_merge(a,mid,b) takes a single range [a,b) which has already been sorted with the equivalent of std::sort(a,mid) and std::sort(mid,b), and merges the two subranges together into a single sorted range. We can use this building block to implement the classic mergesort algorithm:

    template<class RandomIt>
void sort(RandomIt a, RandomIt b)
{
auto n = std::distance(a, b);
if (n >= 2) {
auto mid = a + n/2;
std::sort(a, mid);
std::sort(mid, b);
std::inplace_merge(a, mid, b);
}
}

However, beware! The name inplace_merge seems to imply that the merging is happening "in-place" without the need for any additional buffer space; but this is not what happens in fact. In actuality, the inplace_merge function allocates a buffer for its own use, typically by calling operator new. If you are programming in an environment where heap allocation is problematic, then you should avoid inplace_merge like the plague.

The other standard algorithms that may allocate temporary buffers on the heap are std::stable_sort and std::stable_partition.

std::merge(a,b,c,d,o) is the non-allocating merge algorithm; it takes two iterator-pairs representing the ranges [a,b) and [c,d) and merges them into the output range defined by o.

主站蜘蛛池模板: 茌平县| 瑞安市| 托克托县| 宜都市| 开阳县| 苍梧县| 阿荣旗| 平顺县| 台南市| 宜兰市| 玉树县| 富顺县| 凭祥市| 南阳市| 宣恩县| 沂水县| 元氏县| 高唐县| 合水县| 汉寿县| 新晃| 清水县| 铜山县| 万山特区| 电白县| 西青区| 南溪县| 互助| 吴川市| 丰原市| 莱芜市| 来凤县| 句容市| 望江县| 新建县| 凤城市| 柞水县| 湟中县| 东方市| 乳山市| 宣恩县|