- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Recursive selection sort is a comparison...

Q. |
## Recursive selection sort is a comparison based sort. |

A. | true |

B. | false |

Answer» A. true | |

Explanation: in selection sort we need to compare elements in order to find the minimum element in each iteration. so we can say that it uses comparisons in order to sort the array. thus it qualifies as a comparison based sort. |

View all MCQs in:
Design and Analysis of Algorithms

- 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?
- What will be the best case time complexity of recursive selection sort?
- What is the average case time complexity of recursive selection sort?
- How many recursive calls are there in Recursive matrix multiplication by Strassen’s Method?
- Which of the following is the biggest advantage of selection sort?
- What is the bidirectional variant of selection sort?
- Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?
- Which of the following recursive formula can be used to find the factorial of a number?
- What is the time complexity of the above recursive implementation used to reverse a string?

Login to Continue

It will take less than 2 minutes

Report MCQ