Lecture3 (1)

Runagain withoutwinner

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: n Pw/E recursion until winner is found, take out winner from the table before running Pw/E. ) d. Recursive Pairwise (Run pairwise, find winner. Run again without winner). REDONE EXAMPLE (I WAS WRONG WHEN I PRINTED THESE OUT DURING CLASS, THESE ARE CORRECT.) 5 3 6 2 4 S C G W G G W S G C W G W S S C S C C W Winner is G. Remove G. Place it first. Rankings: 1.) G 5 3 6 2 4 S C S W C W W W S S C S C C W Winner is S. Remove S. Place it second. Rankings: 1.) G 2.) S 5 3 6 2 4 W C W W C C W C C W Winner is W....
View Full Document

This document was uploaded on 03/13/2014 for the course MA 103 at N.C. State.

Ask a homework question - tutors are online