(And not talking about some cheesy insertion sort!!)
If you build an array once and for all, and all you want
is to do binary search on it later, it doesn't make sense to
allocate that big contiguous .data. I'd rather leave it
as an appender.
--jm
On Wednesday, 22 February 2012 at 23:22:35 UTC, Juan Manuel Cabo
wrote:
No, because the array doesn't actually exist until appender
makes copy.
Will one be able to use the sort!()() algorithm directly on
your appender,
that is, without accessing/creating the underlying array?
--jm
