Question

Suppose that your implementation of a particular algorithm appears in Java as

for (int pass = 1; pass<=n; pass++) {

for (int index = 0; index<n; index++) {

for (int count = 1; count<10; count++) {

The previous code shows only the repetitions in the algorithm, not the computations that occur within the loops. These computations, however, are independent of n. what is the order of the algorithm? Justify your answer.

Answer 1

outer loop iterates n times.
middle loop iterates n times.
inner loop iterates 10 times.
total number of iterates n*n*10 = 10n^2.