The running time of Chan’s algorithm is obtained from combining two algorithms.
|Answer» A. true|
|Explanation: the o(n log h) running time of chan’s algorithm is obtained by combining the running time of graham’s scan [o(n log n)] and jarvis match [o(nh)].|
Login to Continue
It will take less than 2 minutes