Jump to content

Sorting algorithms/Bogosort: Difference between revisions

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

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.