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.

idk wbu

step-by-step explanation:

irst, find the z score of a score of 80. this is given by the formula z = (x-u)/o, where x is the score, u is the mean, and o is the standard deviation. this gives

z = (80-78)/12 = 1/6 = .1667

now, find what percentile a z score of 1/6 correlates to in the normal distribution.

a z score of 1/6 = .1667 is equivalent to the 56.36th percentile of the distribution. so the probability a score is over this is 1-.5636 = .4364

the mean of a sample mean is equal to the original mean. however, the standard deviation of a sample mean is equal to the original standard deviation divided by the square root of n (sample size). so the new standard deviation is 12/sqrt(16) = 3.

the new z score is 80-78/3 = 2/3 = .667. this is equivalent to the 74.86th percentile. so the probability that the mean will be greater than this score is 1-.7486 = .2514.

in total they made   333.74 your welcome : d

answer: i also need

step-by-step explanation: