0
6.4kviews
Explain with example how divide and conquer stategy is used in binary search
1 Answer
written 7.2 years ago by | • modified 7.2 years ago |
Binary search is an efficient searching method. While searching the elements using this method the most essential thing that the elements in the array should be sorted one.
An element which is to be sorted from the list of elements sorted in array should be sorted one.
An element which …