Which element would the search element be compared to first, if abinary search were used on the list above?

4

35

44

98

35

Explanation:

Binary search is more efficient than linear search, time complexity of binary is 0 (logn) where as linear's 0 (n). In binary search we search from the middle of the array, whereas in linear we start with index 0 until the last.

4

35

44

98

List contains 4 elements, for finding the middle element we will divide by 2.

4/2=2 so at the index 2 - 35 is present, we will start checking from 35.