CSC 216/s08/eschew disenchantment: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 10: | Line 10: | ||
===Participants and props=== | ===Participants and props=== | ||
Seven students will participate in the exercise. They will need numbered notecards, scotch tape, and a series of hats. There should be seven hats as follows: One master hat, two delegate hats, and four peon hats. | |||
===The script=== | ===The script=== | ||
Describe how to do your exercise. | Describe how to do your exercise. | ||
Revision as of 17:34, 25 March 2008
Formatting Resources
Formatting Help Guide from MetaWiki
The Birthday Merge Sort
The problem
In this exercise, we want to teach students the mechanics of a merge sort algorithm.
Participants and props
Seven students will participate in the exercise. They will need numbered notecards, scotch tape, and a series of hats. There should be seven hats as follows: One master hat, two delegate hats, and four peon hats.
The script
Describe how to do your exercise.