Sorting algorithms/Bogosort: Difference between revisions

Content deleted Content added

Inline

@@ Line 258: / Line 258: @@
 </pre>
 =={{header|Icon}}==
  procedure shuffle(l)
     repeat {
@@ Line 266: / Line 267: @@
  procedure sorted(l)
-    local e, o
+    local i
+    if (i := 2 to *l & l[i] >= l[i-1]) then return &fail else return 1
-    o := l[1]
-    every e := !l do if e > o then return &fail else o := e
-    return 1
  end
  procedure main()
-    local l, m
+    local l
-    l := [6,3,4]
+    l := [6,3,4,5,1]
-    every (m := shuffle(l) & sorted(m))\1 do
+    |( shuffle(l) & sorted(l)) \1 & every writes(" ",!l)
-        every writes(" ",!m)
  end
 =={{header|J}}==