Analysis of Typical Loops
for( int j = 0; j < n; j++ )
{
O(1)
}
Means some
constant-time
computation.
Assume it does not
modify loop index.
Complexity: O(n)
