Using Java

* Demonstration of algorithms for computing the prefix averages of an array. * * @author Michael T. Goodrich * @author Roberto Tamassia * @author Michael H. Goldwasser */ class PrefixAverage {

/** Returns an array a such that, for all j, a[j] equals the average of x[0], ..., x[j]. */ public static double[] prefixAverage1(double[] x) { int n = x.length; double[] a = new double[n]; // filled with zeros by default for (int j=0; j

/** Returns an array a such that, for all j, a[j] equals the average of x[0], ..., x[j]. */ public static double[] prefixAverage2(double[] x) { int n = x.length; double[] a = new double[n]; // filled with zeros by default double total = 0; // compute prefix sum as x[0] + x[1] + ... for (int j=0; j

}

Exercise 2[4 marks) Perform an experimental analysis of the two algorithms prefixAveragel and prefixAverage2. Visualize their running times as a function of the input size with a log-log chart. Use Java graphical capabilities for visualization. Hint: Choose representative values of the input size n, and run at least 5 tests for each size value n. Exercise 2[4 marks) Perform an experimental analysis of the two algorithms prefixAveragel and prefixAverage2. Visualize their running times as a function of the input size with a log-log chart. Use Java graphical capabilities for visualization. Hint: Choose representative values of the input size n, and run at least 5 tests for each size value n