Question

Binary search algorithm use?

Linear way to search values

Divide and conquer method

Bubble sorting technique

None of them​

Answer 1

Answer:

Binary search algorithm use in Divide and conquer method

Answer 2

Answer: divide and conquer

Explanation: In a binary search we use a certain recursive function where the termination condition will invoked if search value is equal to the mid value of array or a while loop which executes until if the search value is the mid value of array.

To begin with in the binary search we have to first sort the array or start with a sorted array. Now there are if conditions that checks if the search value is lesser than on greater than the mid value. If lesser it will search on the 0th index to the mid index of array owing to the fact that the array is sorted. Otherwise we have to start searching from mid+1 Index to the last index. If recursive function are being used then these extremities of the array will be passed as arguments of function. Now these will be continued until the termination condition is met or while condition becomes false.