3 Feb
2009
3 Feb
'09
5:21 p.m.
Edouard A. wrote:
That's a lot of extra copying. [Edouard A.]
I don't do in place merge. I don't know if this would be faster.
May I suggest to store iterators in the allocated storage? After sorting the iterators you could merge them and then apply sorting by simply swapping the elements of the original sequence. If the elements are fat and support fast swapping, this might give some speed.