Computer Science, asked by srithaarani555, 5 months ago


8. The notation in asymptotic evaluation represents
​

Answers

Answered by gurleenkaur46
0

Answer:

The notation Ο(n) is the formal way to express the upper bound of an algorithm's running time. It measures the worst case time complexity or the longest amount of time an algorithm can possibly take to complete.

Previous Question
Next Question
Similar questions
English, 2 months ago
add six more lines to the poem. use alliteration. A tiny bird in the tree was singing songs just for me​ poem The Skylark ​...
English, 2 months ago
i want to know , how to write articles.
English, 2 months ago
Attempt a character sketch of Dashu. Do you think Dashu is a boy who could be modelled by others? Justify your answer.
Math, 5 months ago
13+(-12)+ (-7)=13+(-12) +(-7) which property is used in it​...
Hindi, 5 months ago
(ख) जीवन लाल कमला की विदाई के लिए पाँच हजार रुपए माँगता है। Yes or No​...
English, 10 months ago
most/modern/smaller/than/were/cities/ancient/cities​...
Math, 10 months ago
I have done all the parts but I am not knowing that in (D) AND (E) which identity should I you please tell me which identity is used in(D)AND (E) I will add you on brainless please answer me tomorrow is my exam ​...
Math, 10 months ago
all formula of trigonmetry​...