1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. What is the running time of Hershberger ...
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

Discussion