PART A. We will start by finding the largest value. Initially, we assume that the first element in the list is the largest element and create a variable maxValue that is initialized to the first element in the array. We then compare the element that maxValue is storing with every element in the list. Whenever we find an element in the array larger than the element that maxValue is storing, we update maxValue so that it stores the value of the newer larger element. Algorithm ArrayLargestElement Declare and initialize maxValue to the first element in the array. Use a FOR loop to traverse the array. // You already checked the first element, so you should start the loop at the second element. If the element at this index is larger than maxValue Update maxValue Output maxValue. Write a program MyArray_ABC that declares an array containing the following elements: 45, 38, 27, 46, 81, 72, 56, 61, 20, 48, 76, 91, 57, 35, and 78, and outputs the largest value. Additionally, re‐test your program using the following testing cases: 300, 38, 27, 46, 81, 72, 56, 61, 20, 48, 76, 91, 57, 35, and 78 45, 38, 27, 46, 81, 72, 56, 61, 20, 48, 76, 91, 57, 35, and 800 100 Note: You should comment out (use single line comments //) test cases that you are not using.
PART A. We will start by finding the largest value.
Initially, we assume that the first element in the list is the largest element and create a variable maxValue that is initialized to the first element in the array. We then compare the element that maxValue is storing with every element in the list. Whenever we find an element in the array larger than the element that maxValue is storing, we update maxValue so that it stores the value of the newer larger element.
Write a
Trending now
This is a popular solution!
Step by step
Solved in 5 steps with 4 images
