Gennadiy Rozental wrote:
1. merge the sequences.
That's easy.
2. Eliminate the duplicates (for example like Loki is doing)
That's hard to do efficiently. My MC++D book is packed away
at the moment. Can you refresh my memory as to the solution
there? Is it better then O(n^2)?
-Dave
--
"Some little people have music in them, but Fats, he was all music,
and you know how big he was." -- James P. Johnson
_______________________________________________
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
