Binary search is more efficient than linear search only if the list is:

1. Binary search discards half the list on each step. 2. That is valid only when position implies value. 3. Binary search is more efficient provided the list is arranged in some order. 4. So the answer is arranged in order. _Source: syllabus Computer Science, Ch 5 'Sorting' and Ch 6 'Searching'_