Analyzing Algorithms

To compare algorithms mainly in terms of input size

To compare algorithms mainly in terms of running time (correct)

To compare algorithms mainly in terms of memory requirements

To compare algorithms mainly in terms of programmer's effort

Determining how the running time decreases as the size of the problem increases

Determining the total running time for all possible problem sizes

Determining the exact running time for a given problem size

Determining how the running time increases as the size of the problem increases (correct)

The polynomial degree

The size of an array

The number of elements in the input (correct)

The number of elements in a polynomial

<p>Running time, memory requirements, and programmer's effort</p> Signup and view all the answers

<p>Comparing algorithms in terms of running time</p> Signup and view all the answers