Question: Write a method to shuffle a deck of cards. It must be a perfect shuffle--in other words, each of the 52! Permutations of the deck has to be equally likely. Assume that you are given a random number generator which is perfect.

From: Cracking the Coding Interview [McDowell]

Subject: Hard

Load Another Question

Select a Subject

Select a Subject Algorithm Analysis Arrays and Strings Bit Manipulation C and Cpp Code Quality Combinatorial Search Concurrency Data Structures Databases Design Patterns Dynamic Programming General Graph Theory Hard Java Knowledge Based Linked Lists Math and Logic Puzzles Moderate Object-Oriented Design Recursion Recursion and Dynamic Programming Soft Skills Sorting and Searching Stacks and Queues System Design and Scalability Testing Threads and Locks Trees and Graphs