Big Java Late Objects
Big Java Late Objects
2nd Edition
ISBN: 9781119330455
Author: Horstmann
Publisher: WILEY
Question
Book Icon
Chapter 13, Problem 10PE
Program Plan Intro

Finding largest value in an array

Program plan:

Filename: “DataSet.java”

This program file is used to define a class “DataSet”. In the code,

  • Define a class “DataSet”.
    • Declare class members “values[]”, “first” and “last”.
    • Define a constructor “DataSet ()”.
      • Initialize the “values[]”, “first” and “last”.
    • Define a method “getMaximum()”.
      • If the value of “first” greater than “last”,
        • Return the min value.
          • Create an object “tail” of the class “DataSet”.
          • Call the method “getMaximum” to find the maximum among the numbers.
          • Call the method “max()” and return the value.

Filename: “DataSetDemo.java”

This program file is used to define a class “DataSetDemo”. In the code,

  • Define a class “DataSetDemo”.
    • Define a method “main()”.
      • Create an integer array “values[]”.
      • Create the object of the class “DataSet”.
      • Print the maximum value.
      • Print the expected maximum.

Blurred answer
Students have asked these similar questions
Ninth Edition Determine Zi, Zo and Av 20 V Zi + 1 ΜΩ 2 ΚΩ HH Z IDSS= 6MA Vp=-6V Yos = 40μS 20 and 47
What is the worst case time complexity of the following algorithm for i = 1 to x do  for j = 2^((i-1)x) to 2^(in) do print(i,j)
Prove for each pair of expression f(n) and g(n) whether f(n) is big O, little o Ω,ω or Θ of g(n). For each case it is possible that more than one of these conditions is satisfied:1. f(n) =log(n2^n), g(n) = log(sqrt(n)2^(n^2))2. f(n) =nsqrt(n) +log(n^n), g(n) =n + sqrt(n)logn
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education