3 Feb
2009
3 Feb
'09
5:34 p.m.
On Tue, 03 Feb 2009 20:21:47 +0300, Andrey Semashev <andrey.semashev@gmail.com> wrote:
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.
Thanks for the idea, I already got a lot of feedback and I have a lot of work ahead of me. :) -- EA