What is the time complexity for this programme ?

See more:

C

What is the time complexity for this programme ?

I calculated it like this:
p is noumber of runs

n/(2 power p) = (2 power p) (could we keep "=" here?)

n = (2 power p)(2 power p)
n= 2^2p

p= (logn(base2))^1/2


Time complexity is O((logn(base2))^1/2)

Is it correct? Can we keep equal "=" there ?(As in the program it was given that i<n).

<b>What I have tried:

void fun(int n)
{
    int i=1;
    while(i<n)
    {
        int j=n;
        while(j>0)
        j=j/2;
        i=2*i;
    }
}