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
600
0
Do you find this helpful?
1

Discussion

No comments yet