Sorting algorithms/Bogosort: Difference between revisions

Content added Content deleted

Inline

@@ Line 347: / Line 347: @@
 We use seq-utils' shuffle, which initializes a Java ArrayList with the input sequence, shuffle it, and then return a sequence of the result.
+<lang clojure>(ns bogosort
-<lang lisp>(use 'clojure.contrib.seq-utils)
+  (:use [clojure.contrib.seq-utils :only (shuffle)]))
-(defn in-order? [cmp xs]
+(defn in-order? [less xs]
   (or (empty? xs)
       (empty? (next xs))
-      (and (cmp (first xs) (second xs))
+      (and (less (first xs) (second xs))
-           (recur cmp (next xs)))))
+           (recur less (next xs)))))
+(defn bogosort
+  ([xs]
+     (bogosort < xs))
+  ([less xs]
+     (if (in-order? less xs) xs
+	 (recur less (shuffle xs)))))
-(defn bogosort [cmp xs]
+(println (bogosort [7,5,12,1,4,2,23,18]))</lang>
-  (if (in-order? cmp xs) xs
-      (recur cmp (shuffle xs))))</lang>
 =={{header|Common Lisp}}==