|
Boost : |
From: David A. Greene (greened_at_[hidden])
Date: 2002-11-21 02:10:15
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
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk