Que: 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
Answer: all of the mentioned

Leave a Comment