- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- What is the running time of Chan’s algor...

Q. |
## What is the running time of Chan’s algorithm? |

A. | o(log n) |

B. | o(n log n) |

C. | o(n log h) |

D. | o(log h) |

Answer» C. o(n log h) | |

Explanation: the running time of chan’s algorithm is calculated to be o(n log h) where h is the number of vertices of the convex hull. |

View all MCQs in:
Design and Analysis of Algorithms

- The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.
- What is the average running time of a quick sort algorithm?
- The running time of Chan’s algorithm is obtained from combining two algorithms.
- What is the running time of Hershberger algorithm?
- What is running time of Dijkstra’s algorithm using Binary min- heap method?
- What is the running time of Bellmann Ford Algorithm?
- What is the running time of the Floyd Warshall Algorithm?
- Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
- Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
- Which algorithm is the most efficient numerical algorithm to obtain lcm?

Login to Continue

It will take less than 2 minutes

Report MCQ