Binary & Linear Reading

Which of the following is a method of searching mentioned in the passage?

• Linear search

• Quick search

• Depth-first search

• Breadth-first search

A binary search is more efficient than a linear search because it requires fewer steps in an ordered list. True or False?

• True

• False

In a binary search, if the value at the midpoint is greater than the value to be found, which part of the list is ignored?

• Upper half

• Lower half

• Middle section

• Entire list

A linear search will work on any data set, whether it is ordered or ___.

The midpoint in a binary search is found by adding the lowest position to the highest position and dividing by ___.

A binary search can only work if a list is ___.