give a big-O estimate for the number of operations (where an operation is an
addition or a multiplication) used in this segment of an algorithm. Try to
give the tightest possible polynominal function.
1. t:=1
2. for i=n to n^2 do
3. for j=1 to n^300 do
4. t:= t+t+1000
5. t = t+100
6. end for
7. t:= t+t
8. t = t+7
9. end for