Past exam question: 2064 Jestha, Q10(a)
Open in the Padhaiko appQuestion
Write short notes on: a) Big 'O' notation
Solution
Big 'O' Notation: Big-O () characterizes the asymptotic upper bound on an algorithm's time or space growth rate:
It guarantees that resource consumption grows no faster than a constant multiple of for large (typically representing worst-case complexity, such as for Bubble sort or for Binary search).
Answer:
Big 'O' notation ( for ) gives an asymptotic worst-case upper bound on algorithm complexity independent of hardware constants.