- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- What is the bidirectional variant of sel...

Q. |
## What is the bidirectional variant of selection sort? |

A. | cocktail sort |

B. | bogo sort |

C. | gnome sort |

D. | bubble sort |

Answer» A. cocktail sort | |

Explanation: a bidirectional variant of selection sort is called cocktail sort. it’s an algorithm which finds both the minimum and maximum values in the array in every pass. |

View all MCQs in:
Design and Analysis of Algorithms

- 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?
- Which of the following is the biggest advantage of 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?
- 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 stooge sort fall?
- Quick sort follows Divide-and-Conquer strategy.

Login to Continue

It will take less than 2 minutes

Report MCQ