- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- What is the space complexity of Kadane’s...

Q. |
## What is the space complexity of Kadane’s algorithm? |

A. | o(1) |

B. | o(n) |

C. | o(n2) |

D. | none of the mentioned |

Answer» A. o(1) | |

Explanation: kadane’s algorithm uses a constant space. so, the space complexity is |

View all MCQs in:
Design and Analysis of Algorithms

- What is the auxiliary space complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
- What is the space complexity of the divide and conquer algorithm used to find the maximum sub-array sum?
- Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
- Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
- What is the space complexity of program to reverse stack recursively?
- 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?
- What will be the auxiliary space complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
- What is the computational complexity of Binary GCD algorithm where a and b are integers?
- Which of the following sorting algorithm has best case time complexity of O(n2)?

Login to Continue

It will take less than 2 minutes

Report MCQ