Mathmatters by Chris Waring

Author:Chris Waring
Language: eng
Format: epub
Publisher: Michael O'Mara

I now follow a simple recipe – or algorithm, as mathematicians like to call them – to match everyone up. I choose one of the unassigned people – in this case, Carla or Danny – and get them to choose a station. If there’s no one there, great, move on to the next unassigned person. If there is someone there, they choose another station they can operate. Again, if there’s no one there, go to the next unassigned person, if there is they choose another station. And so this cycle repeats, until everyone is assigned. There may be more than one way to match everyone up, so the choices the individuals make can lead to different matchings. This algorithm is called the Maximum Matching algorithm.

Let’s say I start with Carla. She is trained on stations 3 and 4, both of which are filled. She chooses 3, which bumps Elspeth. Elspeth decides to go to station 5, which is empty. The graph now looks like this:

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.