42. Algorithm - Binary Search Quiz

What is the main advantage of binary search over linear search?

• It is suitable for small number of items

• It starts with the first item

• It requires the data to be in order

• It does not require any sorting

In binary search, what happens if the item to be found is lower than the item at the midpoint?

• Disregard all the items to the left of the midpoint

• Disregard all the items to the right of the midpoint

• Repeat the process on the left half of the data set

• Repeat the process on the right half of the data set

What is the value of the midpoint when the left pointer is 4 and the right pointer is 7?

• 7

• 5

• 6

• 3

How many checks would a linear search perform for a data set of 8 items?

• 3

• 8

• 5

• 7

What is the main disadvantage of binary search?

• It does not require any sorting

• It starts with the first item

• It requires the data to be in order

• It is not suitable for small number of items

What happens if the item to be found is greater than the item at the midpoint in binary search?

• Repeat the process on the right half of the data set

• Disregard all the items to the right of the midpoint

• Repeat the process on the left half of the data set

• Disregard all the items to the left of the midpoint

What is the main advantage of linear search over binary search?

• It starts with the first item

• It requires the data to be in order

• It is suitable for small number of items

• It does not require any sorting

What is the value of the midpoint when the left pointer is 0 and the right pointer is 7?

• 3

• 7

• 5

• 6

How many checks would a binary search perform for a data set of 8 items?

• 8

• 3

• 5

• 7

What happens if the item to be found is the first in the list in binary search?

• Disregard all the items to the right of the midpoint

• Disregard all the items to the left of the midpoint

• Repeat the process on the right half of the data set

• Repeat the process on the left half of the data set