For n=1 : Inner loop will execute 1 time.
For n=2 : Inner loop will execute 1+2 times.
For n=4 : Inner loop will execute 1+2+4 times.
For n=8 : Inner loop will execute 1+2+4+8 times.
. . .
So how can I find the computational complexity?
My answer is : Number of inner loop iterations = n+(n/2)+(n/4)+(n/8)+...+(n/n)