Feb. 6, 2022, 7:45 p.m.
In simple terms, Big O is basically a measure to find out how efficient an algorithm is.
It is a standard mathematical notation that determines the efficiency of an algorithm in worst case scenario.
For this we need to consider 2 things :
(i)Time Complexity : How much time does an algorithm took to complete ?
(ii)Space Complexity : How much space does an algorithm utilise ?
It Captures the upper bound to show how much space or time an algorithm may take in worst case scenario.
It is Usually written as :
F(n)=O(input size)
In simple terms, Big O is basically a measure to find out how efficient an algorithm is.
It is a standard mathematical notation that determines the efficiency of an algorithm in worst case scenario.
For this we need to consider 2 things :
(i)Time Complexity : How much time does an algorithm took to complete ?
(ii)Space Complexity : How much space does an algorithm utilise ?
It Captures the upper bound to show how much space or time an algorithm may take in worst case scenario.
It is Usually written as :
F(n)=O(input size)
Here is a link for more information on Big O .
Click Here for more details