programmin II test 1

A(n) ___________ search is more efficient than a(n) __________ search.

binary, linear

A one-dimensional array can be initialized at the time it is defined, but a two-dimensional array cannot be initialized at the time it is defined.

False

When searching for an item in an unordered set of data, binary search can find the item more quickly than linear search.

False

A(n) _________________ array is like several arrays of the same type put together.

Two Dimensional

What is a possible inefficiency with selection sort?

Inefficient on large lists

To pass an array to a function, in the actual call you pass the ______________________ of the array.

Name

What is the minimum amount of passes that bubble sort will ever make?

One

Which of the sorts discussed so far made the same amount of passes and swaps no matter what order the numbers were in to start with?

Selection

The advantage of a linear search is that ___________.

it is simple and it can be used on unordered data

A binary search begins with the ___________ element of an array.

middle

To add up all the values in a two-dimensional array it would be best to use

nested loops

To access an array element, use the array name and the element's

subscript