Generating random permutations a permutation is a bijection σ : {} → {}. for every n there are n! different permutations. in this task we shall investigate algorithms that given n output a random permutation τ : {} → {}. the goal is for the algorithm on the one hand to spend as little time (in terms of big-oh) as possible, while on the other hand ensure that for every permutation σ it holds that pr[τ = σ] = 1 n! we will assume that the algorithm is given access to a function rand(i) that outputs a random number from {1, . . , i} in constant time.