Exam 3: The Efficiency of Algorithms

____ is the algorithmic equivalence of miles per gallon or use of space in cars.

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

____ are useful for rating one machine against another and for rating how sensitive a particular algorithm is with respect to variations in input on one particular machine.

If an Θ(n²)algorithm and an Θ(n)algorithm exist for the same task, then for large enough n, the Θ(n²)algorithm does more work and takes longer to execute, regardless of the constant factors for peripheral work.

The selection sort algorithm can recognize whether or not the list is already sorted at the beginning.

The number of comparisons done by the selection sort algorithm does not grow at the same rate as the problem size n , instead it grows at approximately the ____________________ of that rate.

How do you approach problems for which no known polynomial solution algorithm exists?

Placing a list of items into alphabetical or numerical order is called ____.

Discuss at length the measurement of the time and space consumed by an algorithm in order to determine its efficiency.

A Hamiltonian circuit is a path through a graph that begins and ends at the same node and goes through all other nodes exactly ________.

Sequential search is an order- n algorithm in the average case.

The copy-over algorithm is ____ in time efficiency in the worst case.

Sequential search is an ____ algorithm in the worst case.

The study of the _______ of algorithms is called the analysis of algorithms.

The selection sort algorithm performs the task of sorting a list by growing a sorted subsection of the list from the _____ to the _____.

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

Binary search uses significantly more space than sequential search.

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 the average number of comparisons done to be approximately n /2.

First and foremost, we expect ease of understanding from our algorithms. _________________________

With sequential search, the smaller the list of items, the less work must be done to search it. _________________________