Thank you for such a detail email on the algorithm. I'll certainly keep that in mind.
This is so far been the most impressive thing I've found about clojure. the community is very friendly and helpful. You've made a newbie feel much more comfortable. On Wed, Jun 3, 2009 at 12:33 PM, Daniel Lyons <fus...@storytotell.org> wrote: > In Clojure, the set data structure is awesome. I have nothing to add > to that. However, I had to do this the other day in Javascript (which > lacks a decent set type) and the algorithm I came up with is this: > > sort both sequences > walk down both sequences: > if the remove list item is greater than the list item, add it to > the result and increment the remove list index > if the remove list item is less than the list item, increment the > list index > if they are equal, increment the remove list index -- Omnem crede diem tibi diluxisse supremum. --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
