On Thu, Dec 30, 2010 at 4:01 AM, Andreas Kostler <andreas.koestler.le...@gmail.com> wrote: > With the initial implementation, using binary search to find the insertion > point should still result in a speed up, right?
Sure, that should help, although it doesn't change the overall quadratic bound unless you can also do the insertion in logarithmic time. It might be worth trying a binary search in your vector-based insert, and see how much of a difference it makes. -- 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
