What is meaning of worst case analysis of algorithms?
Answers
Answered by
0
In computer science, the worst-case complexity (usually denoted in asymptotic notation) measures the resources (e.g. running time, memory) an algorithm requires in the worst-case. ... Moreover, the order of growth of the worst-case complexity is used to compare the efficiency of two algorithms.
Similar questions