Exam 3: The Efficiency of Algorithms

The ____ sort algorithm performs the task of sorting a list by growing a sorted subsection of the list from the back to the front.

Problems for which no known polynomial solution algorithm exists are sometimes approached via ____ algorithms.

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

An ____ algorithm is called an exponential algorithm.

What is the logarithm of n to the base 2?

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

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

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.

A(n) ____________________ is a path through a graph that begins and ends at the same node and goes through all other nodes exactly once.

Binary search uses significantly more space than sequential search.

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

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.

Given a sorted list, the sequential search algorithm is more efficient than the binary search.

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

The shuffle-left algorithm is not space-efficient._________________________

Discuss at length the "people aspect" of the practical considerations for the development of algorithms.Include the concepts of program maintenance and ease of understanding in your response.

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

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

The study of the efficiency of algorithms is called the ____ of algorithms.

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