Table 1 shows the differences between linear search and binary search.

Table 1

	Linear Search	Binary Search
Works on...	All lists	Sorted lists only
Efficiency	Less efficient	More efficient
Simplicity	Very simple	More complicated

Graph 1 shows the maximum number of comparisons against the length of the list for binary and linear search (lower means more efficient).

Graph 1

---

How many comparisons would be needed to find 89 in the list [11, 15, 25, 28, 36, 46, 49, 53, 65, 79, 80, 84, 89, 93, 97] for each algorithm?

13 for linear search (because 89 is the 13^th item in the list) and 4 for binary search (53, 84, 93, 89).

---