COMPUTER SCIENCE AND ENGINEERING
ALGORITHMS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
True
|
|
|
False
|
|
|
Either A or B
|
|
|
None of the above
|
Detailed explanation-1: -Binary search follows the divide and conquer approach in which the list is divided into two halves, and the item is compared with the middle element of the list. If the match is found then, the location of the middle element is returned.
Detailed explanation-2: -Binary Search is not a divide and conquer approach. It is a decrease and conquer approach. In divide and conquer approach, each subproblem must contribute to the solution but in binary search, all subdivision does not contribute to the solution.
Detailed explanation-3: -Cooley–Tukey Fast Fourier Transform (FFT) algorithm is the most common algorithm for FFT. It is a divide and conquer algorithm which works in O(nlogn) time.
Detailed explanation-4: -Binary search is an example of decrease and conquer (divide a list into half the size and search only that one list for the target). For combinatorial problems we might need to generate all permutations or subsets of a set.