πŸ“Š Design and Analysis of Algorithms
Q. The running time of Chan’s algorithm is obtained from combining two algorithms.
  • (A) true
  • (B) false
  • (C) ---
  • (D) ---
πŸ’¬ Discuss
βœ… Correct 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)].


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