Sorting algorithms/Bogosort: Difference between revisions

→‎{{header|Tcl}}: shorten code a bit
(doesn't need saying)
(→‎{{header|Tcl}}: shorten code a bit)
Line 800:
proc shuffleInPlace {listName} {
upvar 1 $listName list
set len [set len2 [llength $list]]
for {set len2i 0} {$i < $len-1} {incr i; incr len2 -1} {
for {set i 0} {$i# <Pick $len-1}cell {incrto i}swap {with
set n [expr {int($i + $len2 * rand())}]
incr# len2Perform -1swap
set temp [lindex $list $i]
lset list $i [lindex $list $n]
Anonymous user