chapter 9

Data arranged from lowest to highest order. This is ____ order.

ascending

The ____ search algorithm repeatedly divides the portion of an array being searched in half.

binary

The _____ search algorithm requires the array's contents be sorted.

binary

A search algorithm is working on a 100 element array. It immediately begins working on a 50 element chunk of the array. This is most likely a _____ algorithm.

binary search

This algorithm makes several passes through an array and causes the larger values to gradually move toward the end of the array with each pass.

bubble sort

Which of the following can be used to arrange data in either ascending or descending order?

bubble sort selection sort insertion sort ALL OF THE ABOVE

Data arranged from highest to lowest order is called _____ order.

descending

This algorithm begins by sorting the first two elements of the array, which become the sorted subset. Then, the third element is moved to it's correct position relative to the first two elements. At that point, the first three elements become the sorted subset. This process continues with the fourth and subsequent elements until the entire array is sorted.

insertion sort

A ____ algorithm is used to locate a specific value in a dynamic variable.

searching

In this algorithm, the smallest value in the array is located and moved to element 0. Then the next smallest value is located and moved to element 1. This process continues until all of the elements have been placed in their proper order.

selection sort

Which of the following sorts is more efficient for large arrays?

selection sort

A ____ algorithm is used to rearrange data into some specific order.

sorting

The selection sort is very efficient because _____.

it moves swapped data to its final position in the array

The ___ search algorithm steps sequentially through an array, comparing each item with the search value.

linear/sequential

The ____ search algorithm is adequate for small arrays but not large arrays.

linear/sequential