Program plan: FindLargestSmallestArray.java Create a class named “FindLargestSmallestArray”. Declare and initialize the array “double[] numbers = new double[LENGTH];” elements with the size “100”. Assign the current “size” of the array as “0”. Using print statement enter the input values up to “100”. Using scanner class, create an object “in” for reading the input values of various types “Scanner in = new Scanner(System.in);”. The “while” loop is used to read each input and store it into the array “numbers” and it increments the “size” value at each iteration. At the end, the values will be stored into the “numbers” array. Next, declare an array variable called “largest” and assume the first element of an array as largest for finding the largest value “double largest = numbers[0]; ” and it stores the first position value of the array “numbers[0] ” into the variable “largest”. Similarly, declare an array variable called “smallest” and assume the first element as smallest for finding the smallest value “double smallest = numbers[0]; ” and it stores the first position value of the array “numbers[0] ” into the variable “smallest”. Inside the “for” loop, at each iteration, The first conditional statement “if (numbers[i] > largest)” checks whether the number stored in the initial array “numbers[0]” is greater than largest value or not. If the condition is true, the larger value will be stored in the “largest” variable. The second conditional statement “if (numbers[i] < smallest)” checks whether the number stored in the initial array “numbers[0]” is lesser than smallest value or not. If the condition is true, the smaller value will be stored in the “smallest” variable. Inside the “for” loop, at each iteration, The first conditional statement “if” prints and marks the largest value in the array. And the second conditional statement “if” prints and marks the smallest value in the array.

Question

Want to see the full answer?

Answer 1

Question

Chapter 6, Problem 3PE

Program Plan Intro

Program plan:

FindLargestSmallestArray.java

Create a class named “FindLargestSmallestArray”.

Declare and initialize the array “double[] numbers = new double[LENGTH];” elements with the size “100”.

Assign the current “size” of the array as “0”.

Using print statement enter the input values up to “100”.

Using scanner class, create an object “in” for reading the input values of various types “Scanner in = new Scanner(System.in);”.

The “while” loop is used to read each input and store it into the array “numbers” and it increments the “size” value at each iteration.

At the end, the values will be stored into the “numbers” array.

Next, declare an array variable called “largest” and assume the first element of an array as largest for finding the largest value “double largest = numbers[0]; ” and it stores the first position value of the array “numbers[0] ” into the variable “largest”.

Similarly, declare an array variable called “smallest” and assume the first element as smallest for finding the smallest value “double smallest = numbers[0]; ” and it stores the first position value of the array “numbers[0] ” into the variable “smallest”.

Inside the “for” loop, at each iteration,

The first conditional statement “if (numbers[i] > largest)” checks whether the number stored in the initial array “numbers[0]” is greater than largest value or not.

If the condition is true, the larger value will be stored in the “largest” variable.

The second conditional statement “if (numbers[i] < smallest)” checks whether the number stored in the initial array “numbers[0]” is lesser than smallest value or not.

If the condition is true, the smaller value will be stored in the “smallest” variable.

Inside the “for” loop, at each iteration,

The first conditional statement “if” prints and marks the largest value in the array.

And the second conditional statement “if” prints and marks the smallest value in the array.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

Exercise 1 Function and Structure [30 pts] Please debug the following program and answer the following questions. There is a cycle in a linked list if some node in the list can be reached again by continuously following the next pointer. #include typedef struct node { int value; struct node *next; } node; int 11_has_cycle (node *first) if (first == node *head = { NULL) return 0; first; while (head->next != NULL) { } if (head first) { return 1; } head = head->next; return 0; void test ll_has_cycle () { int i; node nodes [6]; for (i = 0; i < 6; i++) { nodes [i] .next = NULL; nodes [i].value = i; } nodes [0] .next = &nodes [1]; nodes [1] .next = &nodes [2]; nodes [2] .next = &nodes [3]; nodes [3] .next nodes [4] .next &nodes [4]; NULL; nodes [5] .next = &nodes [0]; printf("1. Checking first list for cycles. \n Function 11_has_cycle says it has s cycle\n\n", 11_has_cycle (&nodes [0])?"a":"no"); printf("2. Checking length-zero list for cycles. \n Function 11_has_cycle says it has %s…

how to read log logs

Discrete Mathematics for Computer Engineering