1.

The Theta notation is the formal way to express ____________ of an algorithm's running time.

A. upper bound
B. lower bound
C. lower bound and upper bound
D. None of the above
Answer» D. None of the above


Discussion

No Comment Found