Answers
How well an algorithm performs, judged by the time taken and the memory used.
Halves a sorted list by checking the middle item then discarding the half that cannot contain the target.
Breaking a large problem into smaller parts so less work is needed to find an answer.
Checks each item in turn from the start until the target is found or the list ends.
A count of how many items are checked against the target each time an algorithm runs.