diff --git a/source/algorithms.tex b/source/algorithms.tex
index cea87802e5..fa7c5fc04f 100644
--- a/source/algorithms.tex
+++ b/source/algorithms.tex
@@ -1444,7 +1444,7 @@
     template<@\libconcept{bidirectional_iterator}@ I, @\libconcept{sentinel_for}@<I> S,
              @\exposconcept{indirectly-binary-right-foldable}@<iter_value_t<I>, I> F>
       requires @\libconcept{constructible_from}@<iter_value_t<I>, iter_reference_t<I>>
-    constexpr auto fold_right_last(I first, S last, F f);
+      constexpr auto fold_right_last(I first, S last, F f);
 
     template<@\libconcept{bidirectional_range}@ R,
              @\exposconcept{indirectly-binary-right-foldable}@<range_value_t<R>, iterator_t<R>> F>
@@ -2200,7 +2200,7 @@
     constexpr void stable_sort(RandomAccessIterator first, RandomAccessIterator last);
   template<class RandomAccessIterator, class Compare>
     constexpr void stable_sort(RandomAccessIterator first, RandomAccessIterator last,
-                     Compare comp);
+                               Compare comp);
   template<class ExecutionPolicy, class RandomAccessIterator>
     void stable_sort(ExecutionPolicy&& exec,                    // see \ref{algorithms.parallel.overloads}
                      RandomAccessIterator first, RandomAccessIterator last);
@@ -2696,7 +2696,7 @@
                 OutputIterator result);
   template<class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
     constexpr OutputIterator
-                set_union(InputIterator1 first1, InputIterator1 last1,
+      set_union(InputIterator1 first1, InputIterator1 last1,
                 InputIterator2 first2, InputIterator2 last2,
                 OutputIterator result, Compare comp);
   template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,