Calculating operation count for Big Oh : `void G(....) 
{`
    `for ( int k = n/2; k > 0; k /= 2 ) 
    {` 
`  for ( int m = 0; m < n; m++)` 
  

     a[(k+m)%n]=k+m; }       
                           
    }

Ok guys, thanks in advance for your help. I'm unsure how to count the loop operations when the loop initiator and increment is like (n/2) and (k/=2) respectively..and so on. Running this code on a compiler for different values of n gave me interesting results, such as if n is 2^x then the iterations are n * x for values of n until 2^(x+1) -1. Now I'm stuck and don't know which Big Oh function to classify this as. Any answers/feedback/suggested learning methods/explanations welcome! Thank you!