Sorting algorithms/Bogosort: Difference between revisions

Sorting algorithms/Bogosort (view source)

117 bytes removed , 3 years ago

Replaced “import math” by “import random”. Removed proc “shuffle” as it is now provided by the module “random”.

Anonymous user

Revision as of 23:00, 29 July 2020 (view source) rosettacode>Gerard Schildberger m (added Category:Sorting) ← Older edit		Revision as of 23:30, 7 November 2020 (view source) rosettacode>Lscrd (Replaced “import math” by “import random”. Removed proc “shuffle” as it is now provided by the module “random”.) Newer edit →
Line 2,028: =={{header\|Nim}}== <lang nim>import ~~math~~random randomize()▼ ▲randomize() ~~proc shuffle[T](x: var openarray[T]) =~~ ~~for i in countdown(x.high, 0):~~ ~~let j = random(i + 1)~~ ~~swap(x[i], x[j])~~ proc isSorted[T](s: openarray[T]): bool =