What is the run time efficiency of the program if the the efficiency of the algorithm *doIt* can be expressed as O(n) = n^2 ?

Question

i = 1
while i<=n:
j = 1
while j<n:
doIt (........)
j = j+1
i = i + 1

Answer 1

Try : https://math.stackexchange.com/questions/917331/question-about-efficiency-of-an-algorithm-big-o