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)].
Q. The running time of Chan’s algorithm is obtained from combining two algorithms.
β
Correct Answer: (A)
true
Explanation by: Mr. Dubey
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)].
Discussion
Question Analytics
120
Total Visits
3 y ago
Published
Mr. Dubey
Publisher
82%
Success Rate