Question

Consider this Java Program. Please answer in typed form in an organized and very detailed answer/explanation. Please provide all your steps. Would be much appreciated will give you an upvote.

Consider the following Java program (where n = a.length, and we assume that n > 5): OOT CON void duplicatePrint(int[] a, int n) { for (int i = 0; i<n; i++) { for (int j = 0; j<i; j++) { for (int k = 0; k < 5; k++) { System.out.println(a[k]); } } Determine the most accurate asymptotic upper bound of the above program, using the big-Oh notation. You must show in detail how you derive your answers. Without a convincing derivation process, you will not receive partial marks.

Answer 1

Here the outer loop iterates n times, and second loop iterate i times and innermost loop iterate 5 times for each value of i and j.

So total number of times, second loop iterates is given by

Si = n(n+1)/2

Now the innermost for loop iterates 5 times for any value of i and j.

Total number of times System.out.println(a[k]) will be executed is

5* i= 5n(n +1)/2 = O(n?

Hence the total time complexity of this function is O(n²).

Please comment for any clarification