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

for (int pass = 100; pass >= 5; pass--)

{

for (int index = 1; index < 2n; index++)

{

for (int count = 1000; count > 2; count = count /2

{

}

}

}

The algorithm involves an array of n items. The previous code shows the only repetition in the algorithm, but it does not show the computations that occur withing the loops. These computations, however, are independent of n. What is the order of the algorithm?

Answer rating: 100% (QA)

To determine the order of the algorithm lets analyze ... View the full answer