Exam 13: Recursion, Complexity, and Searching and Sorting

The general idea behind a ____ algorithm is to break an array into two parts, then rearrange the elements so the larger values are at one end and the smaller values at the other, then repeat until the subparts contain a single value.

FIGURE 13-1 -Figure 13-1 above shows an example of ____.

When a method is called, an activation ____________________ is added to the top of the call stack.

The call stack contains, among other things, the method's local variables.

Identify the letter of the choice that best matches the phrase or definition. a.Activation record b.Stack c.Quadratic d.Exponential e.copyBuffer -The name of the big-O value O(2 to the nth power).

A(n) ____ is a GUI control that allows the user to select a value within a range of values.

execution time = O(n) is an example of big-O ____________________.

Computer scientists use expressions such as O(n) to express the linear relationship between an array's length and the execution time.

mergeSortHelper is a private method that ___.

In a(n) infinite recursion, the algorithm never reaches its stopping state. ____________________

Using a binary search, finding a value from a list of a million entries involves at most 20 steps.

A stack overflow error occurs when ____.

In a linear equation, the best-, worst-, and average-case behaviors are O(1).

Complexity analysis is concerned with determining an algorithm's efficiency.

In order to use a(n) binary search, the list must be sorted in ascending order. ____________________

A(n) ____ object uses a highly repetitive or recursive pattern.

A(n) ____ search starts at the beginning of an array and looks at consecutive elements until the search value is located or the end of the array is reached.

A recursive method must have a well-defined ____.

When a method returns, its activation record is removed from the top of the stack.

A large storage area known as a(n) activation record is created at program startup. ____________________