g$3.$ Mr$.$ X describes his algorithm called Foo using psuedo$-$code as follows:

input: integer i

Let k be an integer variable initialized to be $1$;

while$(1)$

if k$++==$i break;

ret yes;

Is Foo an algorithm? Briefly state your reasoning. How much memory does k use?