Assuming n and i are integer variables and n was assigned a positive integer, the big$-$O of the following algorithm is $\_\_\_\_\_\_\_\_\_.$

i $=$ n;

$$table row blank blank end table$$while $($i $>0)$

$$table row blank end table$\{$

$$table row blank blank end table$$ cout $<<$ i $<<$ endl;

$$table row blank blank end table$$table row blank end table$$i $/=2$;

$$table row blank end table$\}$

O$($log$($n$))$

O$($n$)$

O$($n squared$)$

O$(2$ to the power of n$)$