Sorting algorithms/Bogosort: Difference between revisions
Content added Content deleted
(add FreeBASIC) |
(→{{header|Wren}}: Now uses Wren-sort module.) |
||
| Line 3,114: | Line 3,114: | ||
=={{header|Wren}}== |
=={{header|Wren}}== |
||
{{libheader|Wren-sort}} |
|||
<lang ecmascript>import "random" for Random |
<lang ecmascript>import "random" for Random |
||
import "/sort" for Sort |
|||
var isSorted = Fn.new { |a| |
|||
var len = a.count |
|||
if (len < 2) return true |
|||
for (i in 1...len) { |
|||
if (a[i] < a[i-1]) return false |
|||
} |
|||
return true |
|||
} |
|||
var bogoSort = Fn.new { |a| |
var bogoSort = Fn.new { |a| |
||
var rand = Random.new() |
var rand = Random.new() |
||
while (! |
while (!Sort.isSorted(a)) rand.shuffle(a) |
||
} |
} |
||