What is the average case complexity of a quick hull algorithm?
|B.||o(n 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).|
Login to Continue
It will take less than 2 minutes