COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which algorithm uses a divide and conquer approach?
|
|
Linear Search
|
|
|
Binary Search
|
|
|
Either A or B
|
|
|
None of the above
|
Explanation:
Detailed explanation-1: -The recursive method of binary search follows the divide and conquer approach.
Detailed explanation-2: -Binary Search is one of the fastest searching algorithms. It is used for finding the location of an element in a linear array. It works on the principle of divide and conquer technique.
Detailed explanation-3: -Merge Sort is a Divide and Conquer algorithm. It divides the input array into two halves, calls itself for the two halves, and then merges the two sorted halves. Both Merge Sort and quicksort are based on the divide and conquer method.
There is 1 question to complete.