Sorting algorithms/Bogosort: Difference between revisions

(→‎{{header|Perl}}: ++ octave)
Line 839:
random.shuffle(lst)
return lst</lang>
 
=={{header|R}}==
<lang R>is.sorted <- function(v) {
for(a in 1:(length(v)-1)) {
if ( !all(v[a] <= v[(a+1):length(v)]) ) return(FALSE)
}
TRUE
}
 
shuffle <- function(v) {
l <- length(v)
for(i in 1:l) {
t <- v[i]
r <- floor(runif(1, 1, l+1))
v[i] <- v[r]
v[r] <- t
}
v
}
 
bogosort <- function(v) {
while( ! is.sorted(v) ) {
v <- shuffle(v)
}
v
}
 
n <- c(1, 10, 9, 7, 3, 0)
print(bogosort(n))</lang>
 
=={{header|Ruby}}==