Explain why UOITnet My Institution es not open automatically you can open Lectur

Question

Explain why

UOITnet My Institution es not open automatically you can open Lecture 7 here Exercise What is the time complexity of the following program? 1Ret urns the maximum value of a nonempty array of numbers. / public static double arrayMax(doublel ] data) f 3 int n-data.length; 4 double currentMax- data[0: 5 for (int j-1;j currentMax) 2 / assume first entry is biggest (for now) / consider all other entries // if datali] is biggest thus far... // record it as the current max currentMax = data ; 8return currentMax; Computing Prefix Averages The ith prefix average of an array X is average of the first (i +1) elements of X: Ali1 - (x1o] +xu1+... + Xli)/(i+1)

Explanation / Answer

ANSWER: Here the time complexity of this program will be O(n) because in this arrayMax you are trying to get maximum element of the array so you traversing the array in the inner loop you are comparing for maximum element suppose maximum element is present at the last index of the array so you have to traverse the whole array means you will take time as O(n) so worst case time complexity for this will be O(n).

Related Questions

Navigate

• Browse (All)
• Browse E
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.