A naukri.com initiative
Prodevelopertutorial
3w
325
Image Credit: Prodevelopertutorial
Chapter 5: Asymptotic Notation Big O
- Big O notation is used to calculate the complexity of an algorithm.
- It defines that a function f(n) is equal to O(g(n)) if it is always less than c * g(n).
- Reducing f(n) to g(n) helps in understanding the rate of growth of the function.
- Examples of functions and their corresponding Big O notations are provided.
Read Full Article
19 Likes
For uninterrupted reading, download the app