clojure.core/sort

View this page on ClojureDocs

Type: function Added: Clojure 1.0 Examples: 7 Runnable: 1

([coll] [comp coll])

Returns a sorted sequence of the items in coll. If no comparator is supplied, uses compare. comparator must implement java.util.Comparator. Guaranteed to be stable: equal elements will not be reordered. If coll is a Java array, it will be modified. To avoid this, sort a copy of the array.

Examples

by zmila on 2010-08-11 . May have evaluation errors. ▶

(sort [3 1 2 4]) (1 2 3 4) (sort > (vals {:foo 5, :bar 2, :baz 10})) (10 5 2) ;; do not do this, use sort-by instead because it handles calling the fn (e.g last) and compare for you. (sort #(compare (last %1) (last %2)) {:b 1 :c 3 :a 2}) ([:b 1] [:a 2] [:c 3]) ;; like this: (sort-by last {:b 1 :c 3 :a 2}) ([:b 1] [:a 2] [:c 3])

by yasuto on 2011-05-25 . May have evaluation errors. ▶

;; make a struct 'goods'. it assumes that every goods has ;; its id number and price. (defstruct goods :id :price) ;; generate data. (def data (map #(struct goods %1 %2) (shuffle (range 0 10)) (shuffle (into (range 100 500 100) (range 100 500 100))))) (defn comp-goods-price "a compare function by :price of the struct 'goods.' the sort order is superior to the lower price and if the price is same, it is superior to the lower id." [el1 el2] (or (< (:price el1) (:price el2)) (and (= (:price el1) (:price el2))(< (:id el1) (:id el2))))) data ({:id 1, :price 300} {:id 6, :price 100} {:id 3, :price 100} {:id 4, :price 400} {:id 0, :price 300} {:id 2, :price 200} {:id 5, :price 200} {:id 8, :price 400}) (sort comp-goods-price data) ({:id 3, :price 100} {:id 6, :price 100} {:id 2, :price 200} {:id 5, :price 200} {:id 0, :price 300} {:id 1, :price 300} {:id 4, :price 400} {:id 8, :price 400}) (sort-by :price < data) ; compare this with the above. ({:id 6, :price 100} {:id 3, :price 100} {:id 2, :price 200} {:id 5, :price 200} {:id 1, :price 300} {:id 0, :price 300} {:id 4, :price 400} {:id 8, :price 400})

by jafingerhut on 2012-03-15 . May have evaluation errors. ▶

;; Warning: You can sort a Java array and get back a sorted immutable Clojure ;; data structure, but it will also change the input Java array, by sorting it. ;; Copy the array before sorting if you want to avoid this. (def x (to-array [32 11])) #'user/x (seq x) (32 11) (def y (sort x)) #'user/y ;; Return sorted sequence y (11 32) (class y) clojure.lang.ArraySeq ;; but also modifies x, because it used the array to do the sorting. (seq x) (11 32) ;; One way to avoid this is copying the array before sorting: (def y (sort (aclone x))) #'user/y

by ferdinand-beyer on 2016-11-15 . May have evaluation errors. ▶

;; Sorting with > only works for numbers, whereas sort ;; also works for other types such as vectors. ;; To sort any data in reverse (descending) order, ;; use a negated comparator: (sort (comp - compare) [[1 0] [0 0] [0 3] [2 1]]) ([2 1] [1 0] [0 3] [0 0]) ;; There are subtle cases where negating a comparator can give the wrong sort order. ;; See this article for details, and a more robust suggestion of reversing the ;; order of arguments given to the comparator: ;; https://clojure.org/guides/comparators (sort #(compare %2 %1) [[1 0] [0 0] [0 3] [2 1]]) ([2 1] [1 0] [0 3] [0 0])

by Invertisment on 2017-01-02 . May have evaluation errors. ▶

;; Reverse the collection (sort #(compare %2 %1) '(:a :b :c :d)) (:d :c :b :a)

by ertugrulcetin on 2017-04-07 ▶

(def data [{:v 12, :a 10} {:v 21, :a 113} {:v 1, :a 2} {:v 12, :a 223} {:v 100, :a 23} {:v 1, :a 113}]) (defn multi-comp ([fns a b] (multi-comp fns < a b)) ([[f & others :as fns] order a b] (if (seq fns) (let [result (compare (f a) (f b)) f-result (if (= order >) (* -1 result) result)] (if (= 0 f-result) (recur others order a b) f-result)) 0))) (sort #(multi-comp [:a :v] > %1 %2) data) ;;=> ({:v 12, :a 223} {:v 21, :a 113} {:v 1, :a 113} {:v 100, :a 23} {:v 12, :a 10} {:v 1, :a 2}) (sort #(multi-comp [:a :v] < %1 %2) data) ;;=> ({:v 1, :a 2} {:v 12, :a 10} {:v 100, :a 23} {:v 1, :a 113} {:v 21, :a 113} {:v 12, :a 223})

by malloryerik on 2019-08-18 . May have evaluation errors. ▶

;; Sort strings into ordered character lists (sort "alphabet!321") (\! \1 \2 \3 \a \a \b \e \h \l \p \t) (sort "안녕하세요") (\녕 \세 \안 \요 \하) (sort "花间一壶酒，独酌无相亲。") (\。 \一 \亲 \壶 \无 \独 \相 \花 \酌 \酒 \间 \，)

See also

• clojure.core/sort-by (5)
• clojure.core/compare (3)

---

Content from the matching ClojureDocs page, with authors credited on each contribution.