![Mcqmate logo](https://mcqmate.com/public/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/public/images/logos/logo-white.png)
McqMate
Q. |
What is the average case complexity of a quick hull algorithm? |
A. | o(n) |
B. | o(n log n) |
C. | o(n2) |
D. | o(log n) |
Answer» B. o(n log n) | |
Explanation: the average case complexity of quickhull algorithm using divide and conquer approach is mathematically found to be o(n log n). |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet