Iterative solution to compute powers

I am working on developing an efficient iterative code to compute mⁿ. After some thinking and googling I found this code;

public static int power(int n, int m)
// Efficiently calculates m to the power of n iteratively
{
int pow=m, acc=1, count=n;
while(count!=0)
{
 if(count%2==1)
    acc=acc*pow;
 pow=pow*pow;
 count=count/2;
}
return acc;
}

This logic makes sense to me except the fact that why are we squaring value of pow towards the end each time. I am familiar with similar recursive approach, but this squaring is not looking very intuitive to me. Can I kindly get some help her? An example with explanation will be really helpful.

This is a very tricky solution to understand. I am solving this problem in leetcode and have found the iterative solution. I have spent a whole day to understand this beautiful iterative solution. The main problem is this iterative solution does not work as like its recursive solution.

Let's pick an example to demonstrate. But first I have to re-write your code by replacing some variable name as the name in your given code is very confusing.

// Find m^n
public static int power(int n, int m)
{
    int pow=n, result=1, base=m;
    while(pow > 0)
    {
        if(pow%2 == 1)  result = result * base;
        base = base * base;
        pow = pow/2;
    }
    return result;
}

Let's understand the beauty step by step. Let say, base = 2 and power = 10.

So, after translating the process in pseudo code it will be similar to this,

If power is even:
    base = base * base
    power /= 2
If power is odd:
    result = result * base 
    power -= 1

Now, let have another observation. It is observed that floor(5 / 2) and (5-1) / 2 is same. So, for odd power, we can directly set power / 2 instead of power -= 1. So, the pseudo code will be like the below,

if power is both odd or even:
    base = base * base
    power /= 2
If power is odd:
    result = result *  base

I hope you got the behind the scene.