We want to find 8 in the following list: 2, 6, 5, 1, 11, 18, 8, 0.

Question

We want to find 8 in the following list: 2, 6, 5, 1, 11, 18, 8, 0.

a) Can we use Binary Search Algorithm? Justify your answer.

b) If a Linear Search Algorithm is used to find 8, how many comparison operations (of 8 with an element of the list) are performed until 8 is located?

Answer 1

a) No, because the list is not sorted. You can only perform binary search on sorted collections.

b) 7.