Exam 8: Searching and Sorting Arrays

Before you can perform a selection sort, the data must be stored in ascending order.

The following is the pseudocode for which type of algorithm? Set first to 0 Set last to the last subscript in the array Set found to False Set position to -1 While found is not true and first is less than or equal to last Set middle to the subscript halfway between array[first] and array[last] If array[middle] equals the desired value Set found to true Set position to middle Else If array[middle] is greater than the desired value Set last to middle - 1 Else Set first to middle + 1 End If End While Return position

Array elements must __________ before a binary search can be performed.

The number of comparisons made by a binary search is expressed in powers of two.

On average, an item is just as likely to be found near the beginning of an array as near the end.

The __________ sort usually performs fewer exchanges than the __________ sort.

A __________ algorithm is a method of locating a specific item of information in a larger collection of data.

The advantage of a linear search is its

Assume you have two integer variables, num1 and num2. Which of the following is the correct way to swap the values in these two variables?

When an array is sorted from highest to lowest, it is said to be in

Before you can perform a bubble sort, the data must be stored in descending order.

A(n) __________ search uses a loop to sequentially step through an array.

A __________ search is more efficient than a __________ search.

The following function should swap the values contained in two integer variables, num1 and num2. What, if anything, is wrong with this function? Void swap(int num1, int num2) { Int temp = num2; Num2 = num1; Num1 = temp; }

The following is the pseudocode for which type of algorithm? For start = each array subscript, from the first to the next-to-last MinIndex = start MinValue = array[start] For index = start + 1 To size - 1 If array[index] < minValue MinValue = array[index] MinIndex = index End If End For Swap array[minIndex] with array[start] End For

Algorithms used to arrange random data in some order are __________ algorithms.

The bubble sort is an easy way to arrange data in ascending order but it cannot arrange data in descending order.

The following is the pseudocode for which type of algorithm? For maxElement = each subscript in the array, from the last to the first For index = 0 To maxElement - 1 If array[index] > array[index + 1] Swap array[index] with array[index + 1] End If End For End For

The __________ is adequate for searching through small arrays.

A linear search can only be implemented with integer values.