FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 9: Sorting and Searching Arrays

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 1

True/False

Review LaterAdd Note

Review Later

When values in an array need to be swapped,the array and the size of the array have to be sent to the swap module.

Correct Answer

verified

Show Answer

Question 2

Multiple Choice

Review LaterAdd Note

Review Later

Which sorting algorithm moves elements to their final sorted position in the array?

A) Bubble
B) Selection
C) Insertion
D) Hash
E) None of the above

Correct Answer

verified

Show Answer

Question 3

Short Answer

Review LaterAdd Note

The advantage of the _________ search is its simplicity.

For an array of n items,the average number of comparisons in a sequential search is _______.

Which statement is true after the execution of the following statements? Set t = x Set x = y Set y = t

Which of the following search algorithms should be used on large arrays if speed is important?

When using a module to swap the values in two variables,the arguments must be passed into __________ parameters in the module.

Computer programming languages are only able to perform sort algorithms on numeric arrays.

Which of the following sorting algorithms is the least efficient?

Which of the following is a sorting algorithm?

For an array of n items,the maximum number of comparisons in a sequential search is ______.

In the bubble sort algorithm,the maxElement variable will hold the _______ of the last element that is to be compared to its immediate neighbor.

Swapping the contents of two variables requires a third variable that can serve as a temporary storage location.

In a sequential search,each element is compared to the searchValue and the search stops when the value is found or the end of the array is encountered.

In a sorting algorithm,the sort order can be changed by changing the ________________ operator.

When placing the elements in an array in descending order,the __________ sort begins by finding and placing the largest value in element 0.

In a binary search,what is the maximum number of comparisons that need to be performed if the array contained 1000 elements?

Which sorting algorithm sorts the first two elements of an array before inserting the remaining elements into that sorted part of the array?

The _________ search algorithm locates an item in an array by repeatedly dividing the array in half.

As the __________sorting algorithm makes passes through and compares the elements of the array,certain values move toward the end of the array with each pass.