1.

The Omega notation is the formal way to express the __________ of an algorithms running time.

A. upper bound
B. medium bound
C. lower bound
D. both the lower bound and the upper bound
E.
Answer» D. both the lower bound and the upper bound


Discussion

No Comment Found