Building Java Programs Program Logic and Indefinite Loops.

Slides:



Advertisements
Similar presentations
Copyright 2006 by Pearson Education 1 Building Java Programs Chapter 5: Program Logic and Indefinite Loops.
Advertisements

Copyright 2010 by Pearson Education Building Java Programs Chapter 4 Lecture 4-2: Advanced if/else ; Cumulative sum reading: 4.1, 4.3, 4.5; "Procedural.
Building Java Programs
Copyright 2006 by Pearson Education 1 Building Java Programs Chapter 5: Program Logic and Indefinite Loops.
Copyright 2006 by Pearson Education 1 reading: 4.1 Cumulative sum.
Copyright 2008 by Pearson Education 1 Building Java Programs Chapter 5 Lecture 5-1: while Loops, Fencepost Loops, and Sentinel Loops reading: 4.1, 5.1.
CS305j Introduction to Computing While Loops 1 Topic 15 Indefinite Loops - While Loops "If you cannot grok [understand] the overall structure of a program.
Control Structures II. Why is Repetition Needed? There are many situations in which the same statements need to be executed several times. Example: Formulas.
Building Java Programs Chapter 5 Program Logic and Indefinite Loops.
Building Java Programs Chapter 5
Building Java Programs Chapter 5 Program Logic and Indefinite Loops Copyright (c) Pearson All rights reserved.
Building Java Programs Chapter 5 Program Logic and Indefinite Loops Copyright (c) Pearson All rights reserved.
1 Fencepost loops “How do you build a fence?”. 2 The fencepost problem Problem: Write a class named PrintNumbers that reads in an integer called max and.
1 Building Java Programs Chapter 5 Lecture 5-1: while Loops, Fencepost Loops, and Sentinel Loops; Procedural Design reading: 5.1 – 5.2; 4.5.
1 while loops. 2 Definite loops definite loop: A loop that executes a known number of times.  The for loops we have seen so far are definite loops. We.
Chapter 5: Control Structures II J ava P rogramming: From Problem Analysis to Program Design, From Problem Analysis to Program Design,
Topic 14 while loops and loop patterns Copyright Pearson Education, 2010 Based on slides bu Marty Stepp and Stuart Reges from
Loop - CIS 1068 Program Design and Abstraction Zhen Jiang CIS Dept. Temple University SERC 347, Main Campus 1.
1 Fencepost loops suggested reading: The fencepost problem Problem: Write a static method named printNumbers that prints each number from 1 to a.
Building java programs, chapter 5 Program logic and indefinite loops.
Building Java Programs Chapter 5 Program Logic and Indefinite Loops Copyright (c) Pearson All rights reserved.
CONTROL STATEMENTS LOOPS. WHY IS REPETITION NEEDED?  There are many situations in which the same statements need to be executed several times.  Example:
Cumulative algorithms. 2 Adding many numbers How would you find the sum of all integers from ? // This may require a lot of typing int sum = 1 +
Copyright 2010 by Pearson Education 1 Building Java Programs Chapter 5 Lecture 5-1: while Loops, Fencepost Loops, and Sentinel Loops reading: 4.1, 5.1.
Building Java Programs Chapter 5 Program Logic and Indefinite Loops Copyright (c) Pearson All rights reserved.
Zhen Jiang Dept. of Computer Science West Chester University West Chester, PA CSC141 Computer Science I 2/4/20161.
CS 112 Introduction to Programming Loop Patterns: break; Fencepost Yang (Richard) Yang Computer Science Department Yale University 308A Watson, Phone:
1 BUILDING JAVA PROGRAMS CHAPTER 5 PROGRAM LOGIC AND INDEFINITE LOOPS.
1 Building Java Programs Chapter 5 Lecture 5-1: while Loops, Fencepost Loops, and Sentinel Loops reading: 5.1 – 5.2.
CS 112 Introduction to Programming Program Analysis; Fencepost Loops Yang (Richard) Yang Computer Science Department Yale University 208A Watson, Phone:
1 Building Java Programs Chapter 4: Conditional Execution These lecture notes are copyright (C) Marty Stepp and Stuart Reges, They may not be rehosted,
CSc 110, Autumn 2017 Lecture 15: Strings and Fencepost Loops
Categories of loops definite loop: Executes a known number of times.
CSc 110, Autumn 2017 Lecture 16: Fencepost Loops and Review
CSc 110, Autumn 2017 Lecture 17: while Loops and Sentinel Loops
Lecture 5: Program Logic
Lecture 7: Input and Miscellaneous
Chapter 5: Control Structures II
Repetition-Counter control Loop
Building Java Programs Chapter 5
Building Java Programs Chapter 5
CSc 110, Autumn 2016 Lecture 12: while Loops, Fencepost Loops, and Sentinel Loops Adapted from slides by Marty Stepp and Stuart Reges.
CSc 110, Spring 2017 Lecture 11: while Loops, Fencepost Loops, and Sentinel Loops Adapted from slides by Marty Stepp and Stuart Reges.
Building Java Programs Chapter 4
Building Java Programs
Building Java Programs
Building Java Programs
Fencepost loops reading: 4.1.
CSc 110, Spring 2018 Lecture 16: Fencepost Loops and while loops
Topic 14 while loops and loop patterns
Building Java Programs
Building Java Programs
Building Java Programs
Loop problem Write a method printLetters that prints each letter from a word separated by commas. For example, the call: printLetters("Atmosphere") should.
Building Java Programs
CIS 110: Introduction to Computer Programming
Building Java Programs
Building Java Programs
Building Java Programs
Building Java Programs
Indefinite loop variations
Building Java Programs
Building Java Programs
Building Java Programs
Building Java Programs
CSE 142, Spring 2013 Chapter 5 Lecture 5-1: while Loops, Fencepost Loops, and Sentinel Loops reading: 5.1 – 5.2.
Building Java Programs
Building Java Programs
Building Java Programs
Building Java Programs
Presentation transcript:

Building Java Programs Program Logic and Indefinite Loops

2 A deceptive problem... Write a method printNumbers that prints each number from 1 to a given maximum, separated by commas. For example, the call: printNumbers(5) should print: 1, 2, 3, 4, 5

3 Flawed solutions public static void printNumbers(int max) { for (int i = 1; i <= max; i++) { System.out.print(i + ", "); } System.out.println(); // to end the line of output } –Output from printNumbers(5) : 1, 2, 3, 4, 5, public static void printNumbers(int max) { for (int i = 1; i <= max; i++) { System.out.print(", " + i); } System.out.println(); // to end the line of output } –Output from printNumbers(5) :, 1, 2, 3, 4, 5

4 Fence post analogy We print n numbers but need only n - 1 commas. Similar to building a fence with wires separated by posts: –If we use a flawed algorithm that repeatedly places a post + wire, the last post will have an extra dangling wire. for (length of fence) { place a post. place some wire. }

5 Fencepost loop Add a statement outside the loop to place the initial "post." –Also called a fencepost loop or a "loop-and-a-half" solution. place a post. for (length of fence - 1) { place some wire. place a post. }

6 Fencepost method solution public static void printNumbers(int max) { System.out.print(1); for (int i = 2; i <= max; i++) { System.out.print(", " + i); } System.out.println(); // to end the line } Alternate solution: Either first or last "post" can be taken out: public static void printNumbers(int max) { for (int i = 1; i <= max - 1; i++) { System.out.print(i + ", "); } System.out.println(max); // to end the line }

7 Fencepost question Modify your method printNumbers into a new method printPrimes that prints all prime numbers up to a max. –Example: printPrimes(50) prints 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47 –If the maximum is less than 2, print no output. To help you, use method countFactors which returns the number of factors of a given integer. –countFactors(20) returns 6 due to factors 1, 2, 4, 5, 10, 20.

8 Fencepost partial answer // Prints all prime numbers up to the given max. public static void printPrimes(int max) { if (...) { // Fill in System.out.println(); } // Returns how many factors the given number has. public static int countFactors(int number) { // Fill in }

9 while loops

10 Categories of loops definite loop: Executes a known number of times. –The for loops we have seen are definite loops. Print "hello" 10 times. Find all the prime numbers up to an integer n. Print each odd number between 5 and 127. indefinite loop: One where the number of times its body repeats is not known in advance. Prompt the user until they type a non-negative number. Print random numbers until a prime number is printed. Repeat until the user types "q" to quit.

11 The while loop while loop: Repeatedly executes its body as long as a logical test is true. while ( test ) { statement(s) ; } Example: int num = 1; // initialization while (num <= 200) { // test System.out.print(num + " "); num *= 2; // update }

12 Example while loop // finds the first factor of 91, other than 1 int n = 91; int factor = 2; while (n % factor != 0) { factor++; } System.out.println("First factor is " + factor); –while is better than for because we don't know how many times we will need to increment to find the factor.

13 sentinel: A value that signals the end of user input. –sentinel loop: Repeats until a sentinel value is seen. Example: Write a program that prompts the user for numbers until the user types 0, then outputs their sum. –(In this case, 0 is the sentinel value.) Enter a number (0 to quit): 10 Enter a number (0 to quit): 20 Enter a number (0 to quit): 30 Enter a number (0 to quit): 0 The sum is 60 Sentinel values

14 Flawed sentinel solution What's wrong with this solution? Scanner console = new Scanner(System.in); int sum = 0; int number = 1; // "dummy value", anything but 0 while (number != 0) { System.out.print("Enter a number (0 to quit): "); number = console.nextInt(); sum += number; } System.out.println("The total is " + sum);

15 Changing the sentinel value Modify your program to use a sentinel value of -1. –Example log of execution: Enter a number (-1 to quit): 15 Enter a number (-1 to quit): 25 Enter a number (-1 to quit): 10 Enter a number (-1 to quit): 30 Enter a number (-1 to quit): -1 The total is 80

16 Changing the sentinel value To see the problem, change the sentinel's value to -1: Scanner console = new Scanner(System.in); int sum = 0; int number = 1; // "dummy value", anything but -1 while (number != -1) { System.out.print("Enter a number (-1 to quit): "); number = console.nextInt(); sum = sum + number; } System.out.println("The total is " + sum); Now the solution produces the wrong output. Why? The total was 79

17 The problem with our code Our code uses a pattern like this: sum = 0. while (input is not the sentinel) { prompt for input; read input. add input to the sum. } On the last pass, the sentinel -1 is added to the sum: prompt for input; read input (-1). add input (-1) to the sum. This is a fencepost problem. –Must read N numbers, but only sum the first N-1 of them.

18 A fencepost solution sum = 0. prompt for input; read input.// place a "post" while (input is not the sentinel) { add input to the sum.// place a "wire" prompt for input; read input.// place a "post" } Sentinel loops often utilize a fencepost "loop-and-a-half" style solution by pulling some code out of the loop.

19 Correct sentinel code Scanner console = new Scanner(System.in); int sum = 0; // pull one prompt/read ("post") out of the loop System.out.print("Enter a number (-1 to quit): "); int number = console.nextInt(); while (number != -1) { sum += number; // moved to top of loop System.out.print("Enter a number (-1 to quit): "); number = console.nextInt(); } System.out.println("The total is " + sum);

20 Sentinel as a constant public static final int SENTINEL = -1;... Scanner console = new Scanner(System.in); int sum = 0; // pull one prompt/read ("post") out of the loop System.out.print("Enter a number (" + SENTINEL + " to quit): "); int number = console.nextInt(); while (number != SENTINEL) { sum = sum + number; // moved to top of loop System.out.print("Enter a number (" + SENTINEL + " to quit): "); number = console.nextInt(); } System.out.println("The total is " + sum);