cplusplus
.com
TUTORIALS
REFERENCE
ARTICLES
FORUM
C++
Tutorials
Reference
Articles
Forum
Forum
Beginners
Windows Programming
UNIX/Linux Programming
General C++ Programming
Lounge
Jobs
Forum
General C++ Programming
Algorithm
Algorithm
Oct 12, 2016 at 11:10am UTC
Faz777
(13)
Running Time.
Last edited on
Oct 12, 2016 at 12:34pm UTC
Oct 12, 2016 at 11:50am UTC
a k n
(325)
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.
Oct 12, 2016 at 12:31pm UTC
Faz777
(13)
Great!
Many thanks to you a k n (320)
Oct 12, 2016 at 2:14pm UTC
MikeyBoy
(5631)
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.
Topic archived. No new replies allowed.