Exam 2: Analysis of Algorithms

The analysis of nested loops must take into account both the inner and outer loops.

What does a growth function show?

The time complexity of a loop is found by multiplying the complexity of the body of the loop by how many times the loop will execute.

The ______ of an algorithm is found by eliminating constants and all but the dominant term in the algorithm's growth function.

What is the O(_) of this growth function? ______ 3n⁴+n²+3n-867.5309

Speeding up the processor by a factor of 10 will increase the processing speed by a factor of 10 regardless of the efficiency of the algorithm.

The order of an algorithm provides an ______ to the algorithm's growth function.

The time complexity of a loop is found by multiplying the complexity of the ______ by how many times the loop will execute.

A growth function shows time or space utilization relative to the problem size.

The order of an algorithm refers to the asymptotic complexity of the algorithm's growth function.

Why does speeding up the CPU not necessarily speed up the process by the same amount?