Problem 60216. Perfect shuffle
We call "perfect shuffle" the process of cutting a deck of cards into two equal halves, and then perfectly interleaving them: one card from the left stack, one card from the right stack, one card from the left stack, and so on.
Let "deck" be an array with an even number of elements. Write a function "perfect_shuffle(deck)" that returns a new array constructed according to this shuffle.
For example, perfect_shuffle([1, 2, 3, 4, 5, 6]) should return [1, 4, 2, 5, 3, 6].
Remark: For an array of 1024 elements, after 10 shuffles, we get back to the initial arrangement.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers14
Suggested Problems
-
Remove any row in which a NaN appears
8604 Solvers
-
547 Solvers
-
420 Solvers
-
Sum the numbers on the main diagonal
583 Solvers
-
Approximation of Pi (vector inputs)
221 Solvers
More from this Author53
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!