Notes: Algorithms

Lower Bound:

Any algorithm must take Ω(g(n)) time to solve the problem.

Upper Bound: No More than
Lower Bound: No Less than
 

About

Search

PISIKA Copyright © 2009