Problem 2479. Mongean Shuffle
A Mongean shuffle of an n card deck starts with putting the initial deck on the left hand side.
- The top card of the deck is taken and put on the right hand side.
- The second card from the deck on left is taken and put on top of right deck.
- The third card is taken from the left and and put at the bottom of the right deck.
- The fourth card is put on top of right deck.
- The fifth card is put at the bottom of right deck.
This process is continued until all the cards on left are transferred to the right.
The initial state of the cards will be given. Return the state after this shuffle.
Solution Stats
Problem Comments
-
2 Comments
Jean-Marie Sainthillier
on 4 Aug 2014
See video on Youtube
http://www.youtube.com/watch?v=dVOJMiyVpWA
Jean-Marie Sainthillier
on 16 Aug 2014
If even cards from the deck on left are taken and put on top of right deck, you inverse the correct order. No ?
Solution Comments
Show commentsProblem Recent Solvers88
Suggested Problems
-
Find state names that end with the letter A
1189 Solvers
-
All your base are belong to us
559 Solvers
-
Convert a numerical matrix into a cell array of strings
2213 Solvers
-
Convert a Cell Array into an Array
2044 Solvers
-
4823 Solvers
More from this Author44
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!