swh:1:snp:81eadaa089e8253d8469bcef66aa332632c6c669
Tip revision: d5bfb0e3b7a3211ff2bbe2926e5ba31aa24e4df6 authored by HwB on 09 March 2012, 00:00:00 UTC
version 1.0.1
version 1.0.1
Tip revision: d5bfb0e
perms.R
##
## p e r m s . R Permutations
##
perms <- function(a) {
n <- length(a)
if (length(a) == 0) return(c())
else if (n <= 1) return(matrix(a, 1, 1))
q <- perms(1:(n-1)) # recursive call
m <- nrow(q)
P <- matrix(0, n*m, n)
P[1:m, ] <- cbind(matrix(n, m, 1), q)
for (i in (n-1):1) {
t <- q
t[t == i] <- n
P[(m*(n-i)+1):(m*(n-i+1)), ] <- cbind(i*matrix(1, m, 1), t)
}
b <- a[c(P)]
dim(b) <- dim(P)
return(b)
}
randperm <- function(a) {
n <- length(a)
if (n == 0) return(c())
else if (n <= 1) return(a)
m <- sample(1:n, size = n, replace = FALSE)
return(a[m])
}