what do understand by order of growth with reference to the time complexity of the algorithm??
Answers
Answered by
0
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:
Similar questions
Math,
3 months ago
Math,
3 months ago
Chemistry,
3 months ago
English,
6 months ago
English,
6 months ago
Math,
10 months ago
Social Sciences,
10 months ago
CBSE BOARD XII,
10 months ago