Chapter 4, Problem 11R

Explanation of Solution

Big-Oh characterization in terms of “n”:

The code fragment in 4.12 as follows:

  //Method returns the sum of integers in array

  public static int example3(int[ ] arr)

  {

  //Declare the required variable

  int n = arr.length, total = 0;

  //Execute the for loop from 0 to n-1

  for (int j=0; j < n; j++)

  //Execute the for loop from 0 to n-1

  for (int k=0; k < =j; k++)

  //Sum up the values of array

  total += arr[j];

  //Return the value

  re...