This question evaluates a candidate's skills in statistical experiment design, hypothesis testing, and randomness analysis for algorithmic shuffles, focusing on detecting nonuniformity and inter-run dependence.
You're given a shuffle(arr) function that takes an array of n distinct items and returns a random permutation. Design a rigorous test plan to assess whether the shuffle is uniform and independent across runs.
Requirements:
Assume: We can call shuffle repeatedly as a black box. We can choose n (e.g., 10–52) and run T trials.
Login required