MethodMechanics

MethodMechanics - 1 A Full Program public class...

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

View Full Document Right Arrow Icon

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

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

Unformatted text preview: 1 A Full Program public class FactorialExample extends ConsoleProgram { private static final int MAX_NUM = 4; public void run() { for(int i = 0; i < MAX_NUM; i++) { println(i + "! = " + factorial(i)); } } private int factorial(int n) { int result = 1; for (int i = 1; i <= n; i++) { result *= i; } return result; } } A Full Program public class FactorialExample extends ConsoleProgram { private static final int MAX_NUM = 4; public void run() { for(int i = 0; i < MAX_NUM; i ++) { println( i + "! = " + factorial( i )); } } private int factorial(int n) { int result = 1; for (int i = 1; i <= n; i ++) { result *= i ; } return result; } } public void run() { for(int i = 0; i < MAX_NUM; i++) { println(i + "! = " + factorial(i)); } } i public void run() { for(int i = 0; i < MAX_NUM; i++) { println(i + "! = " + factorial(i)); } } i public void run() { for(int i = 0; i < MAX_NUM; i++) { println(i + "! = " + factorial(i)); } } i public void run() { for(int i = 0; i < MAX_NUM; i++) { println(i + "! = " + factorial(i)); } } i 2 public void run() { for(int i = 0; i < MAX_NUM; i++) { println(i + "! = " + factorial(i)); } } i public void run() { for(int i = 0; i < MAX_NUM; i++) { println(i + "! = " + factorial(i)); } } i private int factorial(int n) { int result = 1; for (int i = 1; i <= n; i++) { result *= i; } return result; } result n i public void run() { for(int i = 0; i < MAX_NUM; i++) { println(i + "! = " + factorial(i)); } } i private int factorial(int n) { int result = 1; for (int i = 1; i <= n; i++) { result *= i; } return result; } 1 result n i public void run() { for(int i = 0; i < MAX_NUM; i++) { println(i + "! = " + factorial(i)); } } i private int factorial(int n) { int result = 1; for (int i = 1; i <= n; i++) { result *= i; } return result;...
View Full Document

This note was uploaded on 10/12/2010 for the course CS 106A at Stanford.

Page1 / 8

MethodMechanics - 1 A Full Program public class...

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

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