AP CSP Big Idea 3 - Binary Search

The binary search starts ______________________________.

• at the beginning

• in the middle

• at the user selection

Data must be sorted in which of the below?

• linear

• sequential

• binary

Data can be sorted (in a binary search) in only ascending order.

• True

• False

Data must be sorted in a linear search.

• True

• False

How does a binary search algorithm works?​

• Dividing the list into halves until the item is matched with one in the list.​

• Starts with the first element and checks the next element consecutively until a match is found.

• ​ None of the above​

An array with 32 elements is input to a binary search algorithm. How many maximum number of comparisons are performed?​

• 32

• 16

• 8

• 5

An array with 32 elements is input to a linear search algorithm. How many maximum number of comparisons are performed?​

• 32

• 16

• 8

• 5

How is the midpoint of the list calculated?​

• midpoint= ((first_index+last_index)/2)​

• midpoint=((first_index+last_index)/3

• midpoint= round ((first_index+last_index)/2)​

You can conduct a binary search on lists with words that are ____________________________________.

• numbered first

• in any order

• in alphabetical order