1. for ( i = 1 ; i <= n ; i++)
{
for ( j= 1 ; j <= i; j++)
{
for ( k = 1 ; k <= j ; k++)
cout<<"a";
}
}
Here , complexity = O(n³)
2.
for ( i = 1 ; i <= n ; i=i*2)
{
for ( j = 1 ; j <= i ; j++)
cout<<"a";
}
Here , complexity = O(n) . But I am getting O(2^n)
(A gp was formed , first term = 1 = 2^0 , last term was 2^n so sum is 2^(n+1) which gives complexity as 2^n)