Unit 8 Algorithms and Recursion Quiz

True or false: If an array is already sorted, Linear Search / Sequential Search is more efficient than Binary Search.

• True

• False

What must be true before performing a binary search?

• The elements must be sorted.

• It can only contain binary values.

• The elements must be some sort of number (i.e. int, double, Integer)

• There are no necessary conditions.

Given this array:

1, 2, 4, 5, 6, 7, 8, 12, 14, 21, 22, 42, 53

How many comparisons are required to find 42 using the Binary Search?

• 3

• 2

• 10

• 5

Given this array:

1, 2, 4, 5, 6, 7, 8, 12, 14, 21, 22, 42, 53

How many comparisons are required to find 42 using the Linear Search / Sequential Search?

• 3

• 2

• 12

• 5

BMO the robot is programming a new game called “Open the box!” You give him a number and he tries to open a numbered box. He’s using Binary Search to accomplish this. Unfortunately, the boxes are not sorted. They are in the following order:

1, 3, 6, 9, 14, 10, 21

Which box can NEVER be found using binary search?

• 9

• 6

• 14

• 10

We are searching for an int key in a sorted int array that has n elements. Under what circumstances will Linear Search / Sequential Search be more efficient than Binary Search?

• key is the last element in the array

• key is in the middle of the array

• n is very large

• key is the first element in the array

• key does not exist in the array

What is the largest number of comparisons needed to perform a binary search on an array with 42 elements?

• 2

• 5

• 6

• 41

• 42

What approach does MergeSort use?

• divide and conquer

• iterative

• search and swap

• search and insert

Which sorting method is implemented?

• Selection Sort

• Insertion Sort

• Mergesort

• Binary Search

• Sequential Search / Linear Search

Given the method below, how many times will the method doSort be called if an array ages contains the value

[23, 12, 9, 46, 34]

and sort(ages) is called?

• 12

• 6

• 9

• 5

• 15