McqMate

Q. |
## What is the worst case time complexity of a quick sort algorithm? |

A. | o(n) |

B. | o(n log n) |

C. | o(n2) |

D. | o(log n) |

Answer» C. o(n2) | |

Explanation: the worst case performance of a quick sort algorithm is mathematically found to be o(n2). |

1k

0

Do you find this helpful?

3

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?
- Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
- What is the worst case complexity of quick hull?
- What is the worst case time complexity of KMP algorithm for pattern searching (m = length of text, n = length of pattern)?
- What is the average case complexity of a quick hull algorithm?
- Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?
- What is the average running time of a quick sort algorithm?
- What is the worst case time complexity of dynamic programming solution of set partition problem(sum=sum of set elements)?
- What will be the best case time complexity of recursive selection sort?
- What is the average case time complexity of recursive selection sort?