McqMate

Q. |
## The optimal time obtained through divide and conquer approach using merge sort is the best case efficiency. |

A. | true |

B. | false |

Answer» A. true | |

Explanation: the optimal time obtained through divide and conquer approach is the best class efficiency and it is given by Ω(n log n). |

2.9k

0

Do you find this helpful?

17

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- What is the optimal time required for solving the closest pair problem using divide and conquer approach?
- Quick sort follows Divide-and-Conquer strategy.
- What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?
- In divide and conquer, the time is taken for merging the subproblems is?
- What is the space complexity of the divide and conquer algorithm used to find the maximum sub-array sum?
- Under what case of Master’s theorem will the recurrence relation of merge sort fall?
- What is the number of swaps required to sort the array arr={5,3,2,4,1} using recursive selection sort?
- Quick sort uses join operation rather than merge operation.
- What will be the best case time complexity of recursive selection sort?
- How many sub arrays does the quick sort algorithm divide the entire array into?