Power of Two - Algorithm

Here's the approach:

$1.$ If $n \leq 0$, return false (powers of two are positive)

$2.$ While $n > 1$, check if $n \bmod 2 = 0$

$3.$ If remainder is not $0$, return false

$4.$ Otherwise, divide $n$ by $2$ and continue

$5.$ If the loop completes ($n = 1$), return true