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

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.

主站蜘蛛池模板: 海安县| 昭觉县| 当雄县| 柳江县| 通化县| 化隆| 本溪市| 东光县| 皋兰县| 阳谷县| 元江| 武平县| 谢通门县| 茶陵县| 百色市| 梅河口市| 定结县| 潜山县| 凯里市| 靖江市| 堆龙德庆县| 普兰店市| 江都市| 会昌县| 呈贡县| 牟定县| 富民县| 垦利县| 禹城市| 资溪县| 泰和县| 北票市| 东丰县| 平顺县| 蒙山县| 内黄县| 兴国县| 禹州市| 依兰县| 大埔区| 淮阳县|