McqMate

Q. |
## What will be the best case time complexity of recursive selection sort? |

A. | o(n) |

B. | o(n2) |

C. | o(log n) |

D. | o(n log n) |

Answer» B. o(n2) | |

Explanation: selection sort’s algorithm is such that it finds the index of minimum element in each iteration even if the given array is already sorted. thus its best case time complexity becomes o(n2). |

4.9k

0

Do you find this helpful?

43

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- What is the average case time complexity of recursive selection sort?
- 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?
- What will be the recurrence relation of the code of recursive selection sort?
- How many recursive calls are there in Recursive matrix multiplication by Strassen’s Method?
- What is the time complexity of the above recursive implementation used to reverse a string?
- What is the time complexity of the above recursive implementation of binary search?
- What is the time complexity of the recursive implementation used to find the nth fibonacci term?
- Which of the following is true about the time complexity of the recursive solution of the subset sum problem?
- Recursive solution of subset sum problem is faster than dynamic problem solution in terms of time complexity.