Sorting algorithms/Bogosort: Difference between revisions
Content added Content deleted
(→{{header|ALGOL 68}}: ++ awk) |
|||
Line 502: | Line 502: | ||
</lang> |
</lang> |
||
=={{header|MAXScript}}== |
|||
<pre>fn notSorted arr = |
|||
( |
|||
if arr.count > 0 then |
|||
( |
|||
local current = arr[1] |
|||
for i in 2 to arr.count do |
|||
( |
|||
if current > arr[i] then |
|||
( |
|||
return true |
|||
) |
|||
current = arr[i] |
|||
) |
|||
) |
|||
false |
|||
) |
|||
fn randSort x y = |
|||
( |
|||
random -1 1 |
|||
) |
|||
fn shuffle arr = |
|||
( |
|||
qsort arr randSort |
|||
arr |
|||
) |
|||
fn bogosort arr = |
|||
( |
|||
while notSorted arr do |
|||
( |
|||
arr = shuffle arr |
|||
) |
|||
arr |
|||
) |
|||
</pre> |
|||
=={{header|Modula-3}}== |
=={{header|Modula-3}}== |