McqMate

Q. |
## What is the space complexity of the divide and conquer algorithm used to find the maximum sub-array sum? |

A. | o(n) |

B. | o(1) |

C. | o(n!) |

D. | o(n2) |

Answer» B. o(1) | |

Explanation: the divide and conquer algorithm uses a constant space. so, the space complexity is o(1). |

673

0

Do you find this helpful?

1

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?
- You are given infinite coins of N denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. What is the time complexity of a dynamic programming implementation used to solve the coin change problem?
- What will be the auxiliary space complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
- Quick sort follows Divide-and-Conquer strategy.
- What is the optimal time required for solving the closest pair problem using divide and conquer approach?
- In divide and conquer, the time is taken for merging the subproblems is?
- The optimal time obtained through divide and conquer approach using merge sort is the best case efficiency.
- What is the worst case time complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
- What is the space complexity of the recursive implementation used to find the nth fibonacci term?
- What is the space complexity of the following dynamic programming implementation used to find the minimum number of jumps?