Analyzing the loop

• s = “”;while (--n >= 0) s = s + x;

O(1)

Each iterationis O(1)

O(length(x) · (1 + 2 +… + n))

= O(1 + 2 + … + n)

= O(n2)

Each iteration isO(length(x) · n)

Previous slide

Next slide

Back to first slide

View graphic version