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).
1.9k
0
Do you find this helpful?
15

Discussion

No comments yet