McqMate

Q. |
## What is the running time of Hershberger algorithm? |

A. | o(log n) |

B. | o(n log n) |

C. | o(n log h) |

D. | o(log h) |

Answer» B. o(n log n) | |

Explanation: hershberger’s algorithm is an output sensitive algorithm whose running |

599

0

Do you find this helpful?

1

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- 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?
- What is the running time of Chan’s algorithm?
- The running time of Chan’s algorithm is obtained from combining two algorithms.
- 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?