- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the following sorting algorithm...

Q. |
## Which of the following sorting algorithm has best case time complexity of O(n2)? |

A. | bubble sort |

B. | selection sort |

C. | insertion sort |

D. | stupid sort |

Answer» B. selection sort | |

Explanation: selection sort is not an adaptive sorting algorithm. it finds the index of minimum element in each iteration even if the |

View all MCQs in:
Design and Analysis of Algorithms

- Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
- Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?
- Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
- What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?
- What is the worst case time complexity of a quick sort algorithm?
- What will be the best case time complexity of recursive selection sort?
- Which of the following sorting algorithm is NOT stable?
- What is the average case complexity of a quick hull algorithm?
- What is the time complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?
- What is the time complexity of Kruskal’s algorithm?

Login to Continue

It will take less than 2 minutes

Report MCQ