I have 2 questions.
1.Let's have an algorithm
input a;
x ← -7;
y ← a;
while x $<$ y do
x ← x+5;
y ← 2·x+y-6;
done
Question: What is the greatest "stopping" input number ($a$) (number for which will the algorithm stop). $a \in \mathbb Z$
2.Let's have an recursive function
FUNCTION funkceG(x):
if x$<$14 then
r ← funkceG(57−4·x)−7;
else
r ← 44;
fi
RETURN r;
Will the function end for all $x$ ? Or is there $x$ for which will the function never end? Where $x \in \mathbb N$
I would like to ask for a how-to, is there a "simple" way to solve this? I don't need answer exactly to these questions, how-to would be awesome. Thanks!