what is the run time complexity of an algorithm?
Answers
Answered by
2
Answer:
In computer science, the time complexity is the computational complexity that describes the amount of time it takes to run an algorithm. ... Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to differ by at most a constant factor.
Similar questions
Social Sciences,
3 months ago
Geography,
3 months ago
English,
3 months ago
Math,
7 months ago
Political Science,
11 months ago
Chemistry,
11 months ago
English,
11 months ago