Question

In type of search the list is divided in to two parts​

Answer 1

Answer:

binary search

Explanation:

In binary search, the sorted array is divided into two parts

Answer 2

In ___type of search, the list is divided into two parts.

A. Linear search

B. Binary search

C. Random search

D. None

Explanation:

• In the Binary search(option B), the list is divided into two parts.

• A binary search is an algorithm to find an item from the sorted list of items.

• They are otherwise called Half interval search, Logarithmic search, or Binary chop.

• The key factor of Binary search is that the array divides the search interval into two halves.