Give a big-Oh notation, in terms of n, of the running time of the algorithm shown...

Transcribed Image Text:

Give a big-Oh notation, in terms of n, of the running time of the algorithm shown in the following code fragment: /** Returns the sum of the prefix sums of given array. */ public static int example 3 (int[] arr) { int n = arr.length, total = 0; for (int j = 0; j <n; j++) // loop from 0 to n-1 for (int k = 0; k <= j; k++) // loop from 0 to j total += arr [j]; return total; } Give a big-Oh notation, in terms of n, of the running time of the algorithm shown in the following code fragment: /** Returns the sum of the prefix sums of given array. */ public static int example 3 (int[] arr) { int n = arr.length, total = 0; for (int j = 0; j <n; j++) // loop from 0 to n-1 for (int k = 0; k <= j; k++) // loop from 0 to j total += arr [j]; return total; }

Answer rating: 100% (QA)

The provided code snippet is a method in Java that calculates the sum of all the prefix sums of an a... View the full answer