Finding the maximum of an array give a big -Oh characterization , in terms of n ,of the running time of arrayMax Method .
Finding the maximum of an array give a big -Oh characterization , in terms of n ,of the running time of arrayMax Method .
Related questions
Question
Finding the maximum of an array
give a big -Oh characterization , in terms of n ,of the running time of arrayMax Method .
![1
/** Returns the maximum value of a nonempty array of numbers. */
2 public static double arrayMax(double[ ] data) {
3
int n = data.length;
4
double current Max = data[0];
for (int j=1; j<n; j++)
5
6
7
if (data[j]> current Max)
current Max = data[j];
return current Max;
8
9 }
// assume first entry is biggest (for now)
// consider all other entries
// if data[j] is biggest thus far...
// record it as the current max](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F2ae76079-938b-4b5d-8ceb-1dfbc10f88ce%2F0d6626f8-d754-4b1a-91c2-128e154a4aed%2Fckz4uq5_processed.png&w=3840&q=75)
Transcribed Image Text:1
/** Returns the maximum value of a nonempty array of numbers. */
2 public static double arrayMax(double[ ] data) {
3
int n = data.length;
4
double current Max = data[0];
for (int j=1; j<n; j++)
5
6
7
if (data[j]> current Max)
current Max = data[j];
return current Max;
8
9 }
// assume first entry is biggest (for now)
// consider all other entries
// if data[j] is biggest thus far...
// record it as the current max
Expert Solution
Step 1: Step 1
The array Max method, which is provided, iterates through an array of numbers to get the largest value therein. Let us examine the algorithm's time complexity in relation to the size of the input array n.
Step by step
Solved in 3 steps
