[alg.merge] Fix some misapplications of P3179R9.

Author: tkoeppe

source/algorithms.tex

@@ -10092,7 +10092,7 @@
   $E(\tcode{e1}, \tcode{e1})$ be \tcode{bool(invoke(comp, invoke(proj2, e2), invoke(proj1, e1)))};
 \item
   $K$ be the smallest integer in \range{0}{last1 - first1}
-  such that for every element \tcode{e1} in the position \tcode{first1 + $K$}
+  such that for the element \tcode{e1} in the position \tcode{first1 + $K$}
   there are at least $N - K$ elements \tcode{e2}
   in \range{first2}{last2} for which $E(\tcode{e1}, \tcode{e1})$ holds,
   and be equal to \tcode{last1 - first1}
@@ -10128,7 +10128,7 @@
   \tcode{result + $N$}
   for the overloads in namespace \tcode{std}.
 \item
-  \tcode{\{first1 + $K$, first2 + $N$ - $K$, result_last\}}
+  \tcode{\{first1 + $K$, first2 + $N$ - $K$, result + $N$\}}
   for the overloads in namespace \tcode{ranges}.
 \end{itemize}