McqMate

Q. |
## What is the average running time of a quick sort algorithm? |

A. | o(n2) |

B. | o(n) |

C. | o(n log n) |

D. | o(log n) |

Answer» C. o(n log n) | |

Explanation: the best case and average case analysis of a quick sort algorithm are mathematically found to be o(n log n). |

1.2k

0

Do you find this helpful?

6

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Which of the following sorting algorithms is used along with quick sort to sort the sub arrays?
- What is the worst case time complexity of a quick sort algorithm?
- How many sub arrays does the quick sort algorithm divide the entire array into?
- The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.
- What is the average case complexity of a quick hull algorithm?
- Quick sort follows Divide-and-Conquer strategy.
- Quick sort uses join operation rather than merge operation.
- 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 is the average case time complexity of recursive selection sort?