[algorithms] Add missing spaces after commas

Author: tkoeppe

source/algorithms.tex

@@ -4192,7 +4192,7 @@
 The first iterator \tcode{i} in the range \range{first}{last-count}
 such that for every non-negative integer \tcode{n} less than \tcode{count}
 the following corresponding conditions hold:
-\tcode{*(i + n) == value, pred(*(i + n),value) != false}.
+\tcode{*(i + n) == value, pred(*(i + n), value) != false}.
 Returns \tcode{last} if no such iterator is found.
 
 \pnum
@@ -9084,11 +9084,11 @@
 
   // \ref{numeric.ops.gcd}, greatest common divisor
   template<class M, class N>
-    constexpr common_type_t<M,N> gcd(M m, N n);
+    constexpr common_type_t<M, N> gcd(M m, N n);
 
   // \ref{numeric.ops.lcm}, least common multiple
   template<class M, class N>
-    constexpr common_type_t<M,N> lcm(M m, N n);
+    constexpr common_type_t<M, N> lcm(M m, N n);
 
   // \ref{numeric.ops.midpoint}, midpoint
   template<class T>
@@ -10020,7 +10020,6 @@
 \end{footnote}
 \end{itemize}
 
-
 \pnum
 \effects
 For the overloads with no \tcode{ExecutionPolicy} and a non-empty range,
@@ -10089,7 +10088,7 @@
 \indexlibraryglobal{gcd}%
 \begin{itemdecl}
 template<class M, class N>
-  constexpr common_type_t<M,N> gcd(M m, N n);
+  constexpr common_type_t<M, N> gcd(M m, N n);
 \end{itemdecl}
 
 \begin{itemdescr}
@@ -10124,7 +10123,7 @@
 \indexlibraryglobal{lcm}%
 \begin{itemdecl}
 template<class M, class N>
-  constexpr common_type_t<M,N> lcm(M m, N n);
+  constexpr common_type_t<M, N> lcm(M m, N n);
 \end{itemdecl}
 
 \begin{itemdescr}
@@ -10138,8 +10137,7 @@
 $|\tcode{m}|$ and $|\tcode{n}|$
 are representable as a value of \tcode{common_type_t<M, N>}.
 The least common multiple of $|\tcode{m}|$ and $|\tcode{n}|$
-is representable as a value of type \tcode{common_type_t<M,N>}.
-
+is representable as a value of type \tcode{common_type_t<M, N>}.
 
 \pnum
 \returns