Exam 3: The Efficiency of Algorithms

Sequential search is a(n) ____ algorithm in the worst case.

A computer program is often written to be used only once to solve a single instance of a problem.

An ____ algorithm is called an exponential algorithm.

The properties that make better algorithms are very similar to the properties we look for when purchasing a car.

The Hamiltonian problem is suspected to be intractable.

In the sequential search algorithm, the worst case occurs when the value being searched for is the first value in the list.

Elegance is the first and foremost expectation of a proper algorithm.

If we were to run the sequential search algorithm many times with random input values occurring at various places in the list, we would find that the loop is executed approximately n times.

____ algorithms are an alternative approach for problems which no known polynomial solution algorithm exists.

The binary search algorithm is ____ in the worst case.