Toggle navigation
About
Contact US
Jobs
Coding
Interview Questions
Submit
CseWay
A Way For Learning
Big-Oh and Big-Omega Notation
datastructures&algorithms
No comments
Big-Oh and Big-Omega Notation
When we say T(n) is O(f(n)), we know that f(n) is an upper bound on the growth rate of
T(n). To specify a lower bound on the growth rate of T(n) we can use the notation T(n) is
W(g(n)).
Newer Post
Older Post
No comments :
Post a Comment
Subscribe to:
Post Comments ( Atom )
Popular Posts
Translate
Contact Form
Name
Email
*
Message
*
No comments :
Post a Comment