Binary search algorithm is divide and conquer because in this algorithm, we simply reduces the size of search interval to half in each successive iteration by simply compares the mid value to the key...
You probably meant 'Divide and Conquer'. This means you can recursively split your problem into smaller problems of the same type, until you reach a stage where you can solve your problem dire...