Exam 3: The Efficiency of Algorithms

Time algorithms taken across multiple machines is the best way for comparing two algorithms that do the same task.

The shuffle-left algorithm is an ____ algorithm in the worst case.

It is well known that solution algorithms that work in polynomial do exist.

Part of the job of program ____ is to make clear any assumptions or restrictions about the input size the program was designed to handle.

Explain the term "brute force" as it applies to algorithms.

What is the logarithm of n to the base 2?

In the sequential search algorithm, the minimum amount of work is done if the value being searched for is the ____ value in the list.

The ____ case of an algorithm requires the least work.

If an algorithm is more time efficient and less space efficient, what is this called?

____________________ problems are solvable, but the solution algorithms all require so much work as to be virtually useless.

Θ(lg n ), Θ( n ), and Θ( n ²)are ____ in the amount of work they do as n increases.

A surprising number of problems fall into the "____" category.

Binary search is able to search any kind of list, regardless of whether or not it is sorted.

The shuffle-left algorithm is not space efficient. _________________________

____ involves the fixing of errors that are uncovered through repeated usage with different input values.

Discuss at length both the best and worst case of the pattern-matching algorithm.

An ____ algorithm is called an exponential algorithm.

Given the data cleanup problem described in the text, write the pseudocode for the converging-pointers algorithm for data cleanup.

Binary search does ____ comparisons in the worst case.

What is the definition of order of magnitude n?