What is the Big O compexity of this algorithm?

Question

I just need to check my understanding of how to analyze big - O complexity. Is this algorithm N^2 or N^3? I'm aware of the many online resources explaining how to analyze an algorithm. I'd like to confirm my understanding.

for(int i=0; i<n; i++)
 for(int j=0; j<n*n; j++)
 sum++

I am nearly 100% certain that I've seen precisely this question earlier today. Looks like a new homework assignment. — David Hoelzer, Feb 14 '16 at 02:34

score 0 · Accepted Answer · edited Feb 14 '16 at 06:00

0

O(n^3) absolutely.

and T(n) = Ω(n^3).  
so T(n) = θ(n^3).`

edited Feb 14 '16 at 06:00

intboolstring

6,891
5
30
44

answered Feb 14 '16 at 03:16

lililqth

378
1
3
7

Thanks for the help! – Connor Ottenbacher Feb 14 '16 at 03:19

What is the Big O compexity of this algorithm?

1 Answers1