Question

what do understand by order of growth with reference to the time complexity of the algorithm??

Answer 1

Answer:

Time Complexity/Order of Growth defines the amount of time taken by any program with respect to the size of the input. Time Complexity specifies how the program would behave as the order of size of input is increased. So, Time Complexity is just a function of size of its input. Time Complexity is represented using Big O notation i.e. O().

Explanation: