McqMate

Q. |
## What is the time complexity of the above recursive implementation of binary search? |

A. | o(n) |

B. | o(2n) |

C. | o(logn) |

D. | o(n!) |

Answer» C. o(logn) | |

Explanation: the time complexity of the above recursive implementation of binary search is o(logn). |

1.8k

0

Do you find this helpful?

14

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- What is the time complexity of the above recursive implementation used to reverse a string?
- What is the time complexity of the recursive implementation used to find the nth fibonacci term?
- What is the space complexity of the recursive implementation used to find the nth fibonacci term?
- Consider the brute force implementation of the rod cutting problem in which all the possible cuts are found and the maximum value is calculated. What is the time complexity of this brute force implementation?
- Consider the brute force implementation in which we find all the possible ways of multiplying the given set of n matrices. What is the time complexity of this implementation?
- What is the time complexity of the above dynamic programming implementation of the assembly line scheduling problem?
- How many recursive calls are there in Recursive matrix multiplication by Strassen’s Method?
- What will be the best case time complexity of recursive selection sort?
- What is the average case time complexity of recursive selection sort?
- Which of the following is true about the time complexity of the recursive solution of the subset sum problem?