Lecture 11-Recursion

# Lecture 11-Recursion - We develop recursive functions and...

This preview shows pages 1–2. Sign up to view the full content.

1 1 CS1110 Lec. 11 5 Oct 2010 More on Recursion We develop recursive functions and look at execution of recursive functions Study Sect 15.1, p. 415. Watch activity 15-2.1 on the CD. In DrJava, write and test as many of the self-review exercises as you can (disregard those that deal with arrays). Thursday 7:30pm prelim: A-K Olin 155, L-Z Olin 255 Wednesday 3:35 lab is less crowded; go there instead? 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . while there is room A draws or ; B draws or ; A wants to get a solid closed curve. B wants to stop A from getting a solid closed curve. Who can win? What strategy to use? . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Board can be any size: m by n dots, with m > 0, n > 0 A won the game to the right because there is a solid closed

This preview has intentionally blurred sections. Sign up to view the full version.

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

## Lecture 11-Recursion - We develop recursive functions and...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online