1.

What is the running time of Boyer-Moore's algorithm?

A. O(n)
B. O(log n)
C. O(m+n)
D. O(mn)
Answer» E.


Discussion

No Comment Found