BETA
Nearest upper bound and nearest lower bound of complexity

For the following code, determine the nearest upper bound of complexity (O) and the nearest lower bound of complexity (Ω), if data is given by the following table. It is known that in the worst case the condition is satisfied in most cases.

Could someone describe the procedure for finding the nearest upper bound and the nearest lower bound of complexity, or give a reference for this type of problems?

Author: h8er
Login to Answer
Sort By:
Oldest
|
Newest
|
Vote
|
My Answer