The method findLargest examines the elements of an array arr which contains non-negative values public static int findLargest(int[] arr)
{
Int curLargest = -1;
For (int i = 0; i < arr.length; i++)
{
If (arr[i] >= curLargest)
{
CurLargest = arr[i];
}
}
Return curLargest;
}
What can you conclude about the running time of this section of code?

Question

The method findLargest examines the elements of an array arr which contains non-negative values public static int findLargest(int[] arr) { Int curLargest = -1; For (int i = 0; i < arr.length; i++) { If (arr[i] >= curLargest) { CurLargest = arr[i]; } } Return curLargest; } What can you conclude about the running time of this section of code? A) Its running time will be O(n). B) Its running time will be O(n²). C) Its running time will be O(log (n)). D) Its running time will be O(n log (n)).

Quizplus · Accepted Answer

The running time of this code is O(n) because it iterates through the array once, and each iteration takes constant time.

The Method FindLargest Examines the Elements of an Array Arr