Anonymous user
Perfect shuffle: Difference between revisions
m
fix typo
(add 'improvement needed' templates to all solutions) |
m (fix typo) |
||
Line 57:
# Write a function that can perform a perfect shuffle on an even-sized list of values.
# Call this function repeatedly to count how many shuffles are needed to get a deck back to its original order, for each of the deck sizes listed under "Test Cases" below.
#* <small>You can use a list of numbers (or
#* <small>Print out the resulting shuffle counts, to demonstrate that your program passes the test-cases.</small>
| |||