Data Structures and Algorithms20785 marksBig O notation with examples
Explain big oh(O) notation with suitable example.
Explain big oh(O) notation with suitable example. [5]
Big Oh notation (O) is used to describe the upper bound of an algorithm's running time or space complexity. It represents the worst-case scenario of an algorithm's growth rate. Formally, a function f(n) = O(g(n)) if and only if there exist positive constants c and n₀ such that: f(n) ≤ c · g(n) fo...