Question

If your algorithm runs its critical section 1 + 2 + 3 + ... + (n-2) + (n-1) + n times, what is the asymptotic behavior of the algorithm?

Answer 1

if 1 and 2 becomes multiplayed gave 3 and 3+3=4 (4-2)+(4-1)= 2+3=4 and 4 is n.