Which of the below sorting algorithms follow divide and conquer mechanism
both option 1 and 2
Binary search we will divided array into 2 halves, and if given number to find is lesser then we will divided left sub array 2 more halves else right sub array into 2 halves. if item is found at middle then we will return the index. This is a kind of dividing and trying to find the solution. so Binary search follows divide and conquer mechanism to find an element if it is available in an array.
Back To Top