McqMate
Q. |
What is the worst case complexity of quick hull? |
A. | o(n) |
B. | o(n log n) |
C. | o(n2) |
D. | o(log n) |
Answer» C. o(n2) | |
Explanation: the worst case complexity of quickhull algorithm using divide and conquer approach is mathematically found to be o(n2). |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet