]> In article <20031205200829.7e29a2c6.Damien.Pous@ens-lyon.fr>, Damien wrote: > > Given two sets A and B, I want to calculate A\B _and_ B\A. The sets > are represented by lists. > > without using an order to sort the lists, is there something better > than the following (O(n^2)) ? If you have a decent hashing function, you can get expected linear time by putting the elements into hash tables. ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners