Question

Which is used to measure the Time complexity of an algorithm Big O notation?

(a) describes limiting behaviour of the function

(b) characterises a function based on growth of function

(c) upper bound on growth rate of the function

(d) all of the mentioned

This question was posed to me in an interview.

My doubt is from Algorithms topic in chapter Algorithms of Discrete Mathematics

Answer 1

Correct option is (d) all of the mentioned

To explain I would say: Big O notation describes limiting behaviour, and also gives upper bound on growth rate of a function.