1. What is meant by a linear search?
An algorithm that compares the value being looked for with the middle item and discards half of the items left
An algorithm that counts how many times the value being looked for appears in a list of items
An algorithm that puts the items of a list into numerical or alphabetical order by comparing pairs of items
An algorithm that compares the value being looked for with each item in turn, starting at the first item
2. What is meant by a binary search?
An algorithm that checks the middle item of a sorted list and then searches both halves of the list in turn
An algorithm that checks the middle item of a sorted list, then throws away the half that cannot hold the value
An algorithm that checks how many items in a list are the same as the value being looked for
An algorithm that checks each item of a list in turn, starting at the first item and stopping when the value is found