Question
What are the words to describe the method in the image below? (from Nelsen's Proofs without Words II)
Attempt
I was thinking and could define the sequence $u_1=2; u_{n+1}=f\circ g^{−1}(u_n)$ where $f(x)=\sqrt x$ and $g(x)=x−2$, as suggested by image, and thus, by the graph, it suggests that the succession defined in this way, is increasing and that $u_n<2$, therefore increased, which was concluded to be convergent. Once it converges, let $l\in\mathbb R$ be its limit.
As $\lim u_n=\lim u_{n+1}$, since for the limit we are only interested in terms starting from a certain order, and that $f\circ g^{−1}$ is a continuous function, a composition of continuous functions is continuous, in the respective domains, we can conclude $\lim u_{n+1}=\lim f(g^{−1}(u_n))\iff l=\sqrt{l+2}$ and thus $l=−1$ or $l=2$, but $−1$ does not belong to the domain of the function. What do you think ? Am I complicating? I believe there will be an easier way out, although that's the idea.
Thanks in advance.

The image is showing two (convergent) fixed-point iterations: $$f: x\mapsto \sqrt{2+x}\quad\text{with the starting value of }x=0\tag 1$$ and $$g: x\mapsto 2+\sqrt{x}\quad\text{with the starting value of }x=2\tag 2$$
However, in contrast to usual depictions of fixed-point iterations over $\Bbb R$, the picture has some extra obfucsations, which are particularly bad in the advertiset "no words, one image will do the trick" context. Hence, prior to discussing the iteration(s), let's point out these obfuscations.
Usually, such depictions of fixed-point iterations have 3 identifying features:
The graph of a function $f(x)$ that's being iterated, for $x$-values that are near the fixed-point(s) of interest.
The line $x=y$ which maps $y$-values back to $x$-values. This is the realization of the iteration of $x\mapsto f(x)$. The line $x=y$ intersects the graph of $f$ at the fixed-point(s) of $f$.
A zig-zag line between these two graphs: Vertical portions implement the mapping $x\mapsto f(x)$, and horizontal portions that take the resulting $y$-values and "transform" them to $x$-values, which can be fed back into $f$ again.
Here is an animation from Wikimedia that's showing the Verhulst process for some parameter (It has an attractive fixed-point around $x=0.6$ and a repelling one at $x=0$):
Obfucsations
The author chose to decompose $f$ and $g$ into a square-root-part $q(x)=\sqrt{x}$ and an adding-2-part $t(x)=2+x$:$$f=q\circ t\qquad\text{and}\qquad g=t\circ q$$
In order to map $y$-values back to $x$-values, they do not use $y\mapsto x$ but the function $t$ which must be used in reverse, namely the contorted $x+2\mapsto x$ which means $x\mapsto x-2$.
The coordinate dimensions are not 1:1. A fixed-point iteration will converge for a smooth $f$, if I. the function is a contraction over some interval, i.e. $f([a,b]) \subseteq [a,b]$ and II. $|f'(x)|<1$ for $x\in [a,b]$. This means that by visual inspection one can discriminate between attracting fixed-points (flat $|f'(x)|<1$ around the fixed-point) and repelling ones (steep $|f'(x)|>1$). Visual inspection is hampered by the distorted aspect ratio, however.
Analysis
As the book mentions $\sqrt{2+\sqrt{2+\sqrt{2+\cdots}}}=2$, I'll restrict myself to iteration $(1)$. As mentioned above, the iteration generates a sequence of values $x_n$ that satisfy $$x_{n+1} = f(x_n) = \sqrt{2+x_n}\quad\text{with } x_0 = 0 \tag 1$$ We already unravelled the very iteration, and I see no reason to include the contrived use of $x+2\mapsto x$ into the analysis.
A necessary condition for convergence is that $f$ has a fixed point, i.e. if $X=\lim_{x\to\infty} x_n$ exists, then we must have $X=f(X)$ which means $X=\sqrt{X+2}$, thus $X^2=X+2$ and $X\geqslant 0$. The only solution is $X=2$. Also notice that $f$ is continuous, and as it's even differentiable, we can estimate $x_n-X$ as follows: $$x_{n-1}-X = f(x_n) - f(X) \stackrel{(3)} = (x_n-X)f'(\xi)\quad\text{ with } \xi\in I(x_n,X)$$ where $I(x_n,X)$ denotes the interval limited by $x_n$ and $X$, and $(3)$ holds due to the mean value theorem.
Now $f$ is increasing and concave, hence we have $x_n \geqslant x_0$ for all $x_n$ and thus
$$|x_{n+1}-X| = |x_n-X|\cdot|f'(\xi)| \leqslant |x_n-X|\cdot\underbrace{|f'(x_0)|}_{\textstyle =1/\sqrt 8}$$ and by induction: $$|x_n-X| \leqslant |x_0-X|\frac1{8^{n/2}}$$ This means that $x_n\to X$ because $|1/\sqrt 8| < 1$.
Notice that this reasoning is pretty general. The only property we used from $X$ is that it is a fixed-point of $f$. And from $f$ we only used that it's smooth, and we managed to estimate $|f'(x) < 1|$ for all $x$ in question. And that is what the picture conveys: $f$ is flat and has a fixed-point, thus the fixed-point is attractive and the iteration will approach it.