Question

What is the computational complexity of the following procedure?

for i in xrange(n):
for j in xrange(n):
print n

Answer 1

How many times will "print" be executed if n equals 1? If it equals 2? 3? 4?

Answer 2

for n = 1, print will be executed once,
for n = 2, print will be executed 4 times.
for n = 4, print will be executed 4*4 = 16 times.
for n = n, print will be executed n^2 times.

Therefore, this procedure has O(N^2) complexity

Answer 3

Well done. :)