15-section-handout-2

# 15-section-handout-2 - Mehran Sahami CS 106A Handout#15...

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

Handout #15 CS 106A October 8, 2007 Section Handout #2 Simple Java Based on a handout by Eric Roberts 1. The Fibonacci sequence In the 13th century, the Italian mathematician Leonardo Fibonacci as a way to explain the geometic growth of a population of rabbits devised a mathematical sequence that now bears his name. The first two terms in this sequence, Fib (0) and Fib (1), are 0 and 1, and every subsequent term is the sum of the preceding two. Thus, the first several terms in the Fibonacci sequence look like this: Fib (0) = 0 Fib (1) = 1 Fib (2) = 1 (0 + 1) Fib (3) = 2 (1 + 1) Fib (4) = 3 (1 + 2) Fib (5) = 5 (2 + 3) Write a program that displays the terms in the Fibonacci sequence, starting with Fib (0) and continuing as long as the terms are less than 10,000. Thus, your program should produce the following sample run: This program continues as long as the value of the term is less than the maximum value, so that the loop construct you need is a while , presumably with a header line that looks

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.

## This note was uploaded on 02/15/2010 for the course CS 106A taught by Professor Sahami,m during the Fall '08 term at Stanford.

### Page1 / 2

15-section-handout-2 - Mehran Sahami CS 106A Handout#15...

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

View Full Document
Ask a homework question - tutors are online