Good day, There is a function FOO that receives two sequences: say, A and B. There is an absolute guarantee that sequence B is received from sequence A by applying next to it N times, e.g. B == (next (next (next... A) | A. What is the fastest way to return sequence C from the function FOO that contains all the heading entries in sequence A in the same order, that are not included in B?
Example: A == [1 2 3 4], B == [3 4], (FOO A B) -> [1 2] I feel it is impossible to introduce a fast O(N) solution when A and B just sequences, and if it is so, what *standard* clojure data structures that preserves the order of elements can be used for doing so? BR, Alex -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
