Example of a complexity calculation in lecture 9

[JensRyeNielsen]

Hej Jeppe

I am a bit confused about your example 2.3 in lecture 9. You calculate the total number of operations to
3n^2+6n+4.
But as i understand the reasoning behind number of operations shouldn't the total number of operations be
6n^2+5n+4
as 1) loop over n*n combinations with 3 assignments and 3 multiplications gives 6n^2 operations 2) loop over n combinations with 2 assignments, 2 multiplications and 1 addition gives 5n?

In advance, many thanks for the help!

Best
Jens

[JeppeDruedahl]

You are correct. I can apparently not count.