Question: Find two strictly increasing functions such that f(n) is not O(g(n)) and g(n) is not O(f(n)), utilizing only simple operations (IE, Exponentials and Factorials are

Find two strictly increasing functions such that f(n) is not O(g(n)) and g(n) is not O(f(n)), utilizing only simple operations (IE, Exponentials and Factorials are okay, but Tibor's "Busy Beaver" functions are not). Make sure that the functions are strictly increasing - for example, f(n) = Sin n and g(n) = Cos n fail to satisfy this requirement.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!