1.

The complexity of Fibonacci series i?

A. O(2<sup>n</sup>)
B. O(log n)
C. O(n<sup>2</sup>)
D. O(n log n)
Answer» B. O(log n)


Discussion

No Comment Found