Algorithm

[Faz777]

Running Time.

[a k n]

Big-O notation is more about the limit at infinity, we are talking about the behaviour of the function as the input gets higher and higher.

Say, we have T(x) = exp(x).
No matter how big K you choose with f(x) = x,
g(x) WILL rise over K*x.

[Faz777]

Great!
Many thanks to you a k n (320)

[MikeyBoy]

Please don't delete your question after you've received an answer. It makes the thread useless for other people, and makes it useless as a resource for other people.

Please edit your initial post to restore the original question.