Question

3. ___________ is preferable when data is stored in primary memory and it must be available in sorted order. [ ] *

a) Sequential search

b) Binary search

c) Interpolation search

d) None of the above

​

Answer 1

Answer:

Binary search

mark as brainliest

Answer 2

Binary search is preferable when data is stored in primary memory and it must be available in sorted order.

• In case of data structure, binary search is the most suitable one if the elements of the array are already sorted or arranged in order.

• It aims at cutting down search space.

• The process of searching starts from the middle element and then proceeds either to the left of right.