which of the following is ALWAYS TRUE?
Let w(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n.
Correct Answer:
A(n) = O(W(n))
total answers (1)
start bookmarking useful questions and collections and save it into your own study-lists, login now to start creating your own collections.
Correct Answer:
A(n) = O(W(n))
need an explanation for this answer? contact us directly to get an explanation for this answer