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
Solution Comments
Show comments
Loading...
Problem Recent Solvers96
Suggested Problems
-
6715 Solvers
-
Similar Triangles - find the height of the tree
470 Solvers
-
Return unique values without sorting
1006 Solvers
-
3507 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2156 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!
See video on Youtube
http://www.youtube.com/watch?v=dVOJMiyVpWA
If even cards from the deck on left are taken and put on top of right deck, you inverse the correct order. No ?