Need confirmation for and answer related to algorithm notations(ϴ,O and Ω)

Asked Oct 16 '16 at 20:27

Active Oct 18 '16 at 07:31

Viewed 25 times

In my class we have to answer a question:

Having this pseudocode:

XPTO(n) sum = 0 if even(n) for i=1 to n sum = sum + i else sum = 0

and knowing that even(n) have complexity ϴ(1), we can say the complexity of XPTO is ϴ(n)? Justify.

How do I justify this?

edited Oct 18 '16 at 07:31

asked Oct 16 '16 at 20:27

Mauro Almeida

What exactly do you mean by "the algorithm is O(_)"? Which cost model are working with? Why do you have O in the worst but Ω in the best case? See here. – Raphael Oct 17 '16 at 08:47
thanks! I understood what you mean. I will answer in a better way. – Mauro Almeida Oct 18 '16 at 07:24

0 Answers0