DEV Community πŸ‘©β€πŸ’»πŸ‘¨β€πŸ’»

Cover image for Learn to Code - BIG O NOTATION
Arya Krishna
Arya Krishna

Posted on

Learn to Code - BIG O NOTATION

The complexity of code in algebraic terms is Big O Notation. In other words Big O Notation determines how efficient your algorithm is!
How is the efficiency of algorithm measured?
In order to measure the efficiency we take into consideration 2 factors.

  1. Time Complexity - The time taken to run the code completely

  2. Space Complexity - The extra space that is required in the process

It is denoted as -

f(n)=O(inputSize)
Enter fullscreen mode Exit fullscreen mode

Big-O notation show how much time or space an algorithm would require in the worst case scenario as the input size grows.

Top comments (0)

🌚 Friends don't let friends browse without dark mode.

Sorry, it's true.