Difference between revisions of "TADM2E 1.5"

Revision as of 18:13, 11 September 2014

<p>First-fit algorithm counterexample:</p> <p> <math>S = \{1, 2, 3\}</math> <br/> <math>T = 5</math> </p>

<p>Best-fit algorithm counterexample:</p> <p> <math>S = \{1, 2, 3\}</math> <br/> <math>T = 5</math> </p>

<p>Largest to smallest algorithm counterexample:</p> <p> <math>S = \{4, 3, 2\}</math> <br/> <math>T = 5</math> </p>

<p>Another counterexample:</p> If <math>t=11</math>, the solution would be the subset <math>\{2, 9\}</math> or <math>\{1, 10\}</math> which none of the algorithms found.

Using first-fit algorithm (left to right)

Using best-fit algorithm (smallest to largest)

Using largest to smallest

Back to Introduction ...