Java Java Help. Please implement FisherYates shuffle for both Permutation and Combination . Input would be random number. Again Implement both Permutation and Combination.

FisherYate is a simple algorithm to generate a permutation of n items uniformly at random without retries, known as the FisherYates shuffle

Fisher-Yates shuffles [edit] A simple algorithm to generate a permutation of n items uniformly at random without retries, known as the Fisher-Yates shuffle, is to start with any permutation (for example, the identity permutation), and then go through the positions 0 through n - 2 (we use a convention where the first element has index 0, and the last element has index n - 1), and for each position i swap the element currently there with a randomly chosen element from positions i through n-1 (the end), inclusive. It's easy to verify that any permutation of n elements will be produced by this algorithm with probability exactly 1!, thus yielding a uniform distribution over all such permutations. unsigned uniform(unsigned m); /* Returns a random integer 0