Sorting algorithms/Bubble sort: Difference between revisions

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.

 

(defn bubble-sort

(doseq [stop-i (range (dec (.size a)) -1 -1)

:while (sorter stop-i)])

=={{header|Common Lisp}}==

Bubble sort an sequence in-place, using the < operator for comparison if no comaprison function is provided

 

=={{header|J}}==

 

Test program:

4 6 8 6 5 8 6 6 6 9

bubbleSort ?. 10 $ 10

 

For the most part, bubble sort works against J's strengths. However, once a single pass has been implemented as a list operation, <code>^:_</code> tells J to repeat this until the result stops changing.