Re: [boost] [move][sort] Asymptotically optimal stable and in-place merging and sorting with no auxiliary memory

As a base line would also be possible to show the performance of `std::inplace_merge` and `std::stable_sort` when `std::get_temporary_buffer` returns a zero sized buffer? That is, in the case that no memory can be allocated, how much better are these new sorting algorithms compared to the std ones?