1 / 65

Chapter 5 Methods

Chapter 5 Methods. Opening Problem. Find the sum of integers from 1 to 10 , from 20 to 30 , and from 35 to 45 , respectively. Problem. int sum = 0; for (int i = 1; i <= 10; i++) sum += i; System.out.println("Sum from 1 to 10 is " + sum); sum = 0; for (int i = 20; i <= 30; i++)

pia
Télécharger la présentation

Chapter 5 Methods

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Chapter 5 Methods

  2. Opening Problem Find the sum of integers from 1 to 10, from 20 to 30, and from 35 to 45, respectively.

  3. Problem int sum = 0; for (int i = 1; i <= 10; i++) sum += i; System.out.println("Sum from 1 to 10 is " + sum); sum = 0; for (int i = 20; i <= 30; i++) sum += i; System.out.println("Sum from 20 to 30 is " + sum); sum = 0; for (int i = 35; i <= 45; i++) sum += i; System.out.println("Sum from 35 to 45 is " + sum);

  4. Problem int sum = 0; for (int i = 1; i <= 10; i++) sum += i; System.out.println("Sum from 1 to 10 is " + sum); sum = 0; for (int i = 20; i <= 30; i++) sum += i; System.out.println("Sum from 20 to 30 is " + sum); sum = 0; for (int i = 35; i <= 45; i++) sum += i; System.out.println("Sum from 35 to 45 is " + sum);

  5. Solution public static int sum(int i1, int i2) { int sum = 0; for (int i = i1; i <= i2; i++) sum += i; return sum; } public static void main(String[] args) { System.out.println("Sum from 1 to 10 is " + sum(1, 10)); System.out.println("Sum from 20 to 30 is " + sum(20, 30)); System.out.println("Sum from 35 to 45 is " + sum(35, 45)); }

  6. Objectives • To define methods, invoke methods, and pass arguments to a method (§5.2-5.5). • To develop reusable code that is modular, easy-to-read, easy-to-debug, and easy-to-maintain. (§5.6). • To use method overloading and understand ambiguous overloading (§5.7). • To design and implement overloaded methods (§5.8). • To determine the scope of variables (§5.9). • To know how to use the methods in the Math class (§§5.10-5.11). • To learn the concept of method abstraction (§5.12). • To design and implement methods using stepwise refinement (§5.12).

  7. Defining Methods A method is a collection of statements that are grouped together to perform an operation.

  8. Method Signature Method signature is the combination of the method name and the parameter list.

  9. Formal Parameters The variables defined in the method header are known as formal parameters.

  10. Actual Parameters When a method is invoked, you pass a value to the parameter. This value is referred to as actual parameter or argument.

  11. Return Value Type A method may return a value. The returnValueType is the data type of the value the method returns. If the method does not return a value, the returnValueType is the keyword void. For example, the returnValueType in the main method is void.

  12. Calling Methods Testing the max method This program demonstrates calling a method max to return the largest of the int values TestMax

  13. animation Calling Methods, cont.

  14. animation Trace Method Invocation i is now 5

  15. animation Trace Method Invocation j is now 2

  16. animation Trace Method Invocation invoke max(i, j)

  17. animation Trace Method Invocation invoke max(i, j) Pass the value of i to num1 Pass the value of j to num2

  18. animation Trace Method Invocation declare variable result

  19. animation Trace Method Invocation (num1 > num2) is true since num1 is 5 and num2 is 2

  20. animation Trace Method Invocation result is now 5

  21. animation Trace Method Invocation return result, which is 5

  22. animation Trace Method Invocation return max(i, j) and assign the return value to k

  23. animation Trace Method Invocation Execute the print statement

  24. CAUTION A return statement is required for a value-returning method. The method shown below in (a) is logically correct, but it has a compilation error because the Java compiler thinks it possible that this method does not return any value. To fix this problem, delete if (n < 0) in (a), so that the compiler will see a return statement to be reached regardless of how the if statement is evaluated.

  25. Reuse Methods from Other Classes NOTE: One of the benefits of methods is for reuse. The max method can be invoked from any class besides TestMax. If you create a new class Test, you can invoke the max method using ClassName.methodName (e.g., TestMax.max).

  26. Call Stacks

  27. animation Trace Call Stack i is declared and initialized

  28. animation Trace Call Stack j is declared and initialized

  29. animation Trace Call Stack Declare k

  30. animation Trace Call Stack Invoke max(i, j)

  31. animation Trace Call Stack pass the values of i and j to num1 and num2

  32. animation Trace Call Stack pass the values of i and j to num1 and num2

  33. animation Trace Call Stack (num1 > num2) is true

  34. animation Trace Call Stack Assign num1 to result

  35. animation Trace Call Stack Return result and assign it to k

  36. animation Trace Call Stack Execute print statement

  37. void Method Example This type of method does not return a value. The method performs some actions. TestVoidMethod

  38. public class TestVoidMethod { • public static void printGrade(double score) { • if (score >= 90.0) { • System.out.println('A'); • } • else if (score >= 80.0) { • System.out.println('B'); • } • else if (score >= 70.0) { • System.out.println('C'); • } • else if (score >= 60.0) { • System.out.println('D'); • } • else { • System.out.println('F'); • } • } • public static void main(String[] args) { • System.out.print("The grade is "); • printGrade(78.5); • System.out.print("The grade is "); • printGrade(59.5); • } • }

  39. Passing Parameters public static void nPrintln(String message, int n) { for (int i = 0; i < n; i++) System.out.println(message); } Suppose you invoke the method using • nPrintln(“Welcome to Java”, 5); What is the output? Suppose you invoke the method using • nPrintln(“Computer Science”, 15); What is the output?

  40. Pass by Value This program demonstrates passing values to the methods. Increment

  41. public class Increment { • public static void main(String[] args) { • int x = 1; • System.out.println("Before the call, x is " + x); • increment(x); • System.out.println("after the call, x is " + x); • } • public static void increment(int n) { • n++; • System.out.println("n inside the method is " + n); • } • } • OUTPUT • Before the call, x is 1 • n inside the method is 2 • after the call, x is 1

  42. Pass by Value Testing Pass by value This program demonstrates passing values to the methods. TestPassByValue

  43. public class TestPassByValue { • public static void main(String[] args) { • int num1 = 1; • int num2 = 2; • System.out.println("Before Calling, num1 is " + • num1 + " and num2 is " + num2); • swap(num1, num2); • System.out.println("After Calling, num1 is " + • num1 + " and num2 is " + num2); • } • public static void swap(int n1, int n2) { • System.out.println("Before swapping n1 is " + n1 + " n2 is " + n2); • int temp = n1; • n1 = n2; • n2 = temp; • System.out.println("After swapping n1 is " + n1+ " n2 is " + n2); • } • }

  44. Pass by Value, cont.

  45. Modularizing Code Methods can be used to reduce redundant coding and enable code reuse. Methods can also be used to modularize code and improve the quality of the program. GreatestCommonDivisorMethod PrimeNumberMethod

  46. import java.util.Scanner; • public class GreatestCommonDivisorMethod{ • public static void main(String[] arg) • Scanner input = new Scanner(System.in); System.out.print("Enter first integer: "); • int n1 = input.nextInt(); • System.out.print("Enter second integer: "); • int n2 = input.nextInt(); • System.out.println("The greatest common divisor for " + n1 + • " and " + n2 + " is " + gcd(n1, n2)); • } • public static intgcd(int n1, int n2) { • intgcd = 1; // Initial gcd is 1 • int k = 1; // Possible gcd • while (k <= n1 && k <= n2) { • if (n1 % k == 0 && n2 % k == 0) • gcd = k; // Update gcd • k++; • } • return gcd; // Return gcd • } • }

  47. Overloading Methods Overloading the max Method public static double max(double num1, double num2) { if (num1 > num2) return num1; else return num2; } TestMethodOverloading

  48. public class TestMethodOverloading{ • public static void main(String[] args) { System.out.println("The maximum between 3 and 4 is “ + max(3, 4)); System.out.println("The maximum between 3.0 and 5.4 is + max(3.0, 5.4)); System.out.println("The maximum between 3.0,5.4,10.14 is“+ max(3.0,5.4, 10.14)); • } • public static int max(int num1, int num2) { • if (num1 > num2) • return num1; • else • return num2; • } • public static double max(double num1, double num2) { • if (num1 > num2) • return num1; • else • return num2; • } • public static double max(double num1, double num2, double num3) { • return max(max(num1, num2), num3); • } • }

  49. Ambiguous Invocation Sometimes there may be two or more possible matches for an invocation of a method, but the compiler cannot determine the most specific match. This is referred to as ambiguous invocation. Ambiguous invocation is a compilation error.

  50. Ambiguous Invocation public class AmbiguousOverloading { public static void main(String[] args) { System.out.println(max(1, 2)); } public static double max(int num1, double num2) { if (num1 > num2) return num1; else return num2; } public static double max(double num1, int num2) { if (num1 > num2) return num1; else return num2; } }

More Related