Exam 3: The Efficiency of Algorithms

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

A collection of nodes and connecting edges is called a(n)graph . _________________________

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.

Explain the sentence: The selection sort algorithm not only does comparisons; it also does exchanges.

The converging-pointers algorithm is Θ( n )in the ____________________ case.

The worst case in binary search occurs ____.

_______ sort is an Θ( n ²)algorithm in all cases.

The things we look for in a new car are similar to the things we look for in a good algorithm.

____________________ is the term used to describe an algorithm's careful use of resources.

The sequential search and selection sort algorithms are different methods to get the same thing done.