Using PriorityQueue should give a good, fast result. Here's my
implementation:
(defn smallest-n [n xs]
(let [q (java.util.PriorityQueue. xs)]
(for [i (range n)] (.poll q))))
(smallest-n 5 (shuffle (range 100)))
;; (0 1 2 3 4)
Jim
--
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
