McqMate

Q. |
## Under what case of Master’s theorem will the recurrence relation of stooge sort fall? |

A. | 1 |

B. | 2 |

C. | 3 |

D. | it cannot be solved using master’s theorem |

Answer» A. 1 | |

Explanation: the recurrence relation of stooge sort is given as t(n) = 3t(2/3n) + o(1). it is found too be equal to o(n2.7) using master’s theorem first case. |

2k

0

Do you find this helpful?

16

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Under what case of Master’s theorem will the recurrence relation of merge sort fall?
- Under what case of Master’s theorem will the recurrence relation of binary search fall?
- What is the result of the recurrences which fall under second case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc?
- What is the result of the recurrences which fall under third case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc?
- What is the result of the recurrences which fall under the extended second case of Master’s theorem (let the recurrence be given by T(n)=aT(n/b)+f(n) and f(n)=nc(log n)k?
- What will be the recurrence relation of the code of recursive selection sort?
- We can solve any recurrence by using Master’s theorem.
- Recursive selection sort is a comparison based sort.
- What is the number of swaps required to sort the array arr={5,3,2,4,1} using recursive selection sort?
- Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?