Anonymous user
Sorting algorithms/Bubble sort: Difference between revisions
→{{header|Clojure}}: fixed compilation error due to typo; small improvements; added example invocation
(→{{header|Oz}}: added functional version) |
(→{{header|Clojure}}: fixed compilation error due to typo; small improvements; added example invocation) |
||
Line 344:
Bubble sorts a Java ArrayList in place. Uses 'doseq' iteration construct with a short-circuit when a pass didn't produce any change, and within the pass, an atomic 'changed' variable that gets reset whenever a change occurs.
<lang
(:import java.util.ArrayList))
(defn bubble-sort
"Sort in-place.
arr must implement the Java List interface and should support
random access, e.g. an ArrayList."
([arr] (bubble-sort compare arr))
([cmp
(letfn [(swap! [i j]
(.set i (.get arr j))
(if (pos? (cmp (.get arr i) (.get arr (inc i))))
▲ (let [changed (atom false)]
(do
(reset! changed true))))
:while (sorter stop-i)])
arr)))
▲ :while (sorter stop-i)])
(println (bubble-sort (ArrayList. [10 9 8 7
=={{header|Common Lisp}}==
Bubble sort an sequence in-place, using the < operator for comparison if no comaprison function is provided
| |||