11-14 Class Notes CS 107

11-14 Class Notes CS 107 - Anagrams Sierpinski Gasket...

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

View Full Document Right Arrow Icon
For lab this week you will be asked to modify the maze program, changing values in the maze as you go instead of using the cameFrom array. Program #5 is due Thursday Announcements: ...some. .. Questions? Detailed exploration of the maze example, using recursion to traverse a 2-D maze. Last Time: A couple more examples of recursion. Today: Quiz: To keep track of where we came from A. To make sure we don't bounce between adjacent squares B. To display the solution path recursively in order C. All of the above D. Not much E. In the maze traversal example, what is the cameFrom array used for?
Background image of page 1

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

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Anagrams Sierpinski Gasket Fractal Tree Examples (from online web page on Java recursion): Count the number of characters in a line of input (e.g. count the number of digits) Assume the line of input has a '~' as the last character (and is nowhere else on the line.) 1. Test yourself: How would you write a recursive program to: 11-14 Class Notes CS 107 Monday, November 14, 2011 2:12 PM CS 107 Fall 2011 Page 1 Program to do this posted online under the course notes Determine whether or not a String is a palindrome 2. CS 107 Fall 2011 Page 2...
View Full Document

Page1 / 2

11-14 Class Notes CS 107 - Anagrams Sierpinski Gasket...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online