8. The notation in asymptotic evaluation represents
Answers
Answered by
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.
Similar questions