cpprefjp · teruyamato0731 · Apr 13, 2026 · Apr 13, 2026
diff --git a/reference/algorithm/adjacent_find.md b/reference/algorithm/adjacent_find.md
@@ -157,6 +157,11 @@ ForwardIterator adjacent_find(ForwardIterator first, ForwardIterator last, Binar
 - [ICC](/implementation.md#icc): ??
 - [Visual C++](/implementation.md#visual_cpp): ??
 
+
+## 関連項目
+- [`ranges::adjacent_find`](/reference/algorithm/ranges_adjacent_find.md)
+
+
 ## 参照
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
 - [P0574R1 Algorithm Complexity Constraints and Parallel Overloads](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0574r1.html)
diff --git a/reference/algorithm/all_of.md b/reference/algorithm/all_of.md
@@ -88,6 +88,7 @@ bool all_of(InputIterator first, InputIterator last, Predicate pred) {
 ## 関連項目
 - [`any_of`](/reference/algorithm/any_of.md)
 - [`none_of`](/reference/algorithm/none_of.md)
+- [`ranges::all_of`](/reference/algorithm/ranges_all_of.md)
 
 
 ## 参照

diff --git a/reference/algorithm/any_of.md b/reference/algorithm/any_of.md
@@ -89,6 +89,7 @@ bool any_of(InputIterator first, InputIterator last, Predicate pred) {
 ## 関連項目
 - [`all_of`](/reference/algorithm/all_of.md)
 - [`none_of`](/reference/algorithm/none_of.md)
+- [`ranges::any_of`](/reference/algorithm/ranges_any_of.md)
 
 
 ## 参照

diff --git a/reference/algorithm/binary_search.md b/reference/algorithm/binary_search.md
@@ -163,6 +163,11 @@ bool binary_search(ForwardIterator first, ForwardIterator last,
 - [ICC](/implementation.md#icc): ??
 - [Visual C++](/implementation.md#visual_cpp): ??
 
+
+## 関連項目
+- [`ranges::binary_search`](/reference/algorithm/ranges_binary_search.md)
+
+
 ## 参照
 - [LWG Issue 787. complexity of `binary_search`](http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#787)
     - C++03までの計算量が間違っていたので、C++11で修正。

diff --git a/reference/algorithm/clamp.md b/reference/algorithm/clamp.md
@@ -78,6 +78,10 @@ int main()
 - [Visual C++](/implementation.md#visual_cpp): ??
 
 
+## 関連項目
+- [`ranges::clamp`](/reference/algorithm/ranges_clamp.md)
+
+
 ## 参照
 - [N4536 An algorithm to "clamp" a value between a pair of boundary values](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/n4536.html)
 - [P0025R0 An algorithm to "clamp" a value between a pair of boundary values (revision 1)](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/p0025r0.html)
diff --git a/reference/algorithm/copy.md b/reference/algorithm/copy.md
@@ -102,6 +102,11 @@ OutputIterator copy(InputIterator first, InputIterator last, OutputIterator resu
 - [ICC](/implementation.md#icc): ??
 - [Visual C++](/implementation.md#visual_cpp): ??
 
+
+## 関連項目
+- [`ranges::copy`](/reference/algorithm/ranges_copy.md)
+
+
 ## 参照
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
 - [P0467R2 Iterator Concerns for Parallel Algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html)
diff --git a/reference/algorithm/copy_backward.md b/reference/algorithm/copy_backward.md
@@ -95,5 +95,9 @@ BidirectionalIterator2 copy_backward(BidirectionalIterator1 first,
 - [Visual C++](/implementation.md#visual_cpp): ??
 
 
+## 関連項目
+- [`ranges::copy_backward`](/reference/algorithm/ranges_copy_backward.md)
+
+
 ## 参照
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
diff --git a/reference/algorithm/copy_if.md b/reference/algorithm/copy_if.md
@@ -112,6 +112,10 @@ OutputIterator copy_if(InputIterator first, InputIterator last,
 - [Visual C++](/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]
 
 
+## 関連項目
+- [`ranges::copy_if`](/reference/algorithm/ranges_copy_if.md)
+
+
 ## 参照
 - [N2569 More STL algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2569.pdf)
 - [N2666 More STL algorithms (revision 2)](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2666.pdf)

diff --git a/reference/algorithm/copy_n.md b/reference/algorithm/copy_n.md
@@ -89,6 +89,10 @@ OutputIterator copy_n(InputIterator first, Size n, OutputIterator result) {
 - [Visual C++](/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]
 
 
+## 関連項目
+- [`ranges::copy_n`](/reference/algorithm/ranges_copy_n.md)
+
+
 ## 参照
 - [N2569 More STL algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2569.pdf)
 - [N2666 More STL algorithms (revision 2)](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2666.pdf)

diff --git a/reference/algorithm/count.md b/reference/algorithm/count.md
@@ -141,6 +141,11 @@ typename iterator_traits<InputIterator>::difference_type
 - [ICC](/implementation.md#icc): ??
 - [Visual C++](/implementation.md#visual_cpp): ??
 
+
+## 関連項目
+- [`ranges::count`](/reference/algorithm/ranges_count.md)
+
+
 ## 参照
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
 - [P0467R2 Iterator Concerns for Parallel Algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html)

diff --git a/reference/algorithm/count_if.md b/reference/algorithm/count_if.md
@@ -83,6 +83,10 @@ typename iterator_traits<InputIterator>::difference_type
 - [Visual C++](/implementation.md#visual_cpp): ??
 
 
+## 関連項目
+- [`ranges::count_if`](/reference/algorithm/ranges_count_if.md)
+
+
 ## 参照
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
 - [P0467R2 Iterator Concerns for Parallel Algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html)
diff --git a/reference/algorithm/equal.md b/reference/algorithm/equal.md
@@ -219,6 +219,10 @@ inline bool equal(InputIterator1 first1, InputIterator1 last1,
 - [Visual C++](/implementation.md#visual_cpp): 2015 [mark verified]
 
 
+## 関連項目
+- [`ranges::equal`](/reference/algorithm/ranges_equal.md)
+
+
 ## 参照
 - [N3671 Making non-modifying sequence operations more robust: Revision 2](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3671.html)
     - C++14から追加された、`last2`を受け取るオーバーロードの提案文書

diff --git a/reference/algorithm/equal_range.md b/reference/algorithm/equal_range.md
@@ -147,6 +147,11 @@ int main() {
 3,4
 ```
 
+
+## 関連項目
+- [`ranges::equal_range`](/reference/algorithm/ranges_equal_range.md)
+
+
 ## 参照
 - [LWG Issue 384. `equal_range` has unimplementable runtime complexity](http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#384)
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)

diff --git a/reference/algorithm/fill.md b/reference/algorithm/fill.md
@@ -136,6 +136,10 @@ void fill(ForwardIterator first, ForwardIterator last, const T& value) {
 ```
 
 
+## 関連項目
+- [`ranges::fill`](/reference/algorithm/ranges_fill.md)
+
+
 ## 参照
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
 - [P2248R8 Enabling list-initialization for algorithms](https://open-std.org/jtc1/sc22/wg21/docs/papers/2024/p2248r8.html)

diff --git a/reference/algorithm/fill_n.md b/reference/algorithm/fill_n.md
@@ -169,6 +169,10 @@ fill_n(OutputIterator first, Size n, const T& value) {
 	- C++11への対応（戻り値の変更）は2012から。
 
 
+## 関連項目
+- [`ranges::fill_n`](/reference/algorithm/ranges_fill_n.md)
+
+
 ## 参照
 - [LWG DR865. More algorithms that throw away information](http://cplusplus.github.io/LWG/lwg-defects.html#865)  
 	戻り値が追加されるきっかけとなったレポート

diff --git a/reference/algorithm/find.md b/reference/algorithm/find.md
@@ -134,6 +134,10 @@ InputIterator find(InputIterator first, InputIterator last, const T& value) {
 ```
 
 
+## 関連項目
+- [`ranges::find`](/reference/algorithm/ranges_find.md)
+
+
 ## 参照
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
 - [P0467R2 Iterator Concerns for Parallel Algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html)

diff --git a/reference/algorithm/find_end.md b/reference/algorithm/find_end.md
@@ -136,6 +136,10 @@ ForwardIterator1 find_end(ForwardIterator1 first1, ForwardIterator1 last1,
 * std::search[link search.md]
 
 
+## 関連項目
+- [`ranges::find_end`](/reference/algorithm/ranges_find_end.md)
+
+
 ## 参照
 - [LWG Issue 2150. Unclear specification of `find_end`](http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#2150)
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
diff --git a/reference/algorithm/find_first_of.md b/reference/algorithm/find_first_of.md
@@ -136,6 +136,10 @@ InputIterator find_first_of(InputIterator first1, InputIterator last1,
 ```
 
 
+## 関連項目
+- [`ranges::find_first_of`](/reference/algorithm/ranges_find_first_of.md)
+
+
 ## 参照
 - [LWG Issue 576. `find_first_of` is overconstrained](http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#576)
     - C++11から、パラメータのイテレータ型に対する制約が緩和され、`ForwardIterator`から`InputIterator`に変更になった経緯のレポート

diff --git a/reference/algorithm/find_if.md b/reference/algorithm/find_if.md
@@ -71,6 +71,10 @@ InputIterator find_if(InputIterator first, InputIterator last, Predicate pred) {
 ```
 
 
+## 関連項目
+- [`ranges::find_if`](/reference/algorithm/ranges_find_if.md)
+
+
 ## 参照
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
 - [P0467R2 Iterator Concerns for Parallel Algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html)
diff --git a/reference/algorithm/find_if_not.md b/reference/algorithm/find_if_not.md
@@ -72,6 +72,10 @@ InputIterator find_if_not(InputIterator first, InputIterator last, Predicate pre
 ```
 
 
+## 関連項目
+- [`ranges::find_if_not`](/reference/algorithm/ranges_find_if_not.md)
+
+
 ## 参照
 - [N2569 More STL algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2569.pdf)
 - [N2666 More STL algorithms (revision 2)](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2666.pdf)

diff --git a/reference/algorithm/for_each.md b/reference/algorithm/for_each.md
@@ -157,6 +157,10 @@ Function for_each(InputIterator first, InputIterator last, Function f) {
 ```
 
 
+## 関連項目
+- [`ranges::for_each`](/reference/algorithm/ranges_for_each.md)
+
+
 ## 参照
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
 - [P0467R2 Iterator Concerns for Parallel Algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html)
diff --git a/reference/algorithm/for_each_n.md b/reference/algorithm/for_each_n.md
@@ -94,6 +94,10 @@ int main()
 - [Visual C++](/implementation.md#visual_cpp): ??
 
 
+## 関連項目
+- [`ranges::for_each_n`](/reference/algorithm/ranges_for_each_n.md)
+
+
 ## 参照
 - [P0024R2 The Parallelism TS Should be Standardized](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2016/p0024r2.html)
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)

diff --git a/reference/algorithm/generate.md b/reference/algorithm/generate.md
@@ -73,5 +73,9 @@ void generate(ForwardIterator first, ForwardIterator last, Generator gen) {
 ```
 
 
+## 関連項目
+- [`ranges::generate`](/reference/algorithm/ranges_generate.md)
+
+
 ## 参照
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
diff --git a/reference/algorithm/generate_n.md b/reference/algorithm/generate_n.md
@@ -108,6 +108,10 @@ generate_n(OutputIterator first, Size n, Generator gen) {
     - C++11への対応（戻り値の変更）は2012から。
 
 
+## 関連項目
+- [`ranges::generate_n`](/reference/algorithm/ranges_generate_n.md)
+
+
 ## 参照
 - [LWG DR865. More algorithms that throw away information](http://cplusplus.github.io/LWG/lwg-defects.html#865)  
 	戻り値が追加されるきっかけとなったレポート

diff --git a/reference/algorithm/includes.md b/reference/algorithm/includes.md
@@ -121,6 +121,10 @@ bool includes(InputIterator1 first1, InputIterator1 last1,
 ```
 
 
+## 関連項目
+- [`ranges::includes`](/reference/algorithm/ranges_includes.md)
+
+
 ## 参照
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
 - [P0467R2 Iterator Concerns for Parallel Algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html)
diff --git a/reference/algorithm/inplace_merge.md b/reference/algorithm/inplace_merge.md
@@ -108,6 +108,10 @@ int main()
 - [`inplace_merge` を読んでみた](http://www.kmonos.net/wlog/115.html#_2300101215)
 
 
+## 関連項目
+- [`ranges::inplace_merge`](/reference/algorithm/ranges_inplace_merge.md)
+
+
 ## 参照
 - [P2562R1 `constexpr` Stable Sorting](https://open-std.org/jtc1/sc22/wg21/docs/papers/2022/p2562r1.pdf)
     - C++26から`constexpr`に対応した
diff --git a/reference/algorithm/is_heap.md b/reference/algorithm/is_heap.md
@@ -89,6 +89,10 @@ before: is heap? false
     - 2008では、`_HAS_TRADITIONAL_STL`を1に定義してから`<algorithm>`をインクルードすると、`stdext`名前空間で`is_heap`が定義される。
 
 
+## 関連項目
+- [`ranges::is_heap`](/reference/algorithm/ranges_is_heap.md)
+
+
 ## 参照
 - [N2246 2 of the least crazy ideas for the standard library in C++0x](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2246.html)
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
diff --git a/reference/algorithm/is_heap_until.md b/reference/algorithm/is_heap_until.md
@@ -129,6 +129,10 @@ RandomAccessIterator is_heap_until(RandomAccessIterator first, RandomAccessItera
 - [Visual C++](/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]
 
 
+## 関連項目
+- [`ranges::is_heap_until`](/reference/algorithm/ranges_is_heap_until.md)
+
+
 ## 参照
 - [N2246 2 of the least crazy ideas for the standard library in C++0x](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2246.html)
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
diff --git a/reference/algorithm/is_partitioned.md b/reference/algorithm/is_partitioned.md
@@ -110,6 +110,10 @@ bool is_partitioned(InputIterator first, InputIterator last, Predicate pred)
 - [Visual C++](/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]
 
 
+## 関連項目
+- [`ranges::is_partitioned`](/reference/algorithm/ranges_is_partitioned.md)
+
+
 ## 参照
 - [N2569 More STL algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2569.pdf)
 - [N2666 More STL algorithms (revision 2)](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2666.pdf)

diff --git a/reference/algorithm/is_permutation.md b/reference/algorithm/is_permutation.md
@@ -222,6 +222,11 @@ bool is_permutation(ForwardIterator1 first1, ForwardIterator1 last1,
 - [Visual C++](/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]
     - C++14で追加されたオーバーロードは2015から実装されている。
 
+
+## 関連項目
+- [`ranges::is_permutation`](/reference/algorithm/ranges_is_permutation.md)
+
+
 ## 参照
 - [N3671 Making non-modifying sequence operations more robust: Revision 2](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3671.html)
     - C++14から追加された、`last2`を受け取るオーバーロードの提案文書

diff --git a/reference/algorithm/is_sorted.md b/reference/algorithm/is_sorted.md
@@ -83,6 +83,10 @@ before: is sorted? false
     - 2008では、`_HAS_TRADITIONAL_STL`を1に定義してから`<algorithm>`をインクルードすると、`stdext`名前空間で`is_sorted`が定義される。
 
 
+## 関連項目
+- [`ranges::is_sorted`](/reference/algorithm/ranges_is_sorted.md)
+
+
 ## 参照
 - [N2246 2 of the least crazy ideas for the standard library in C++0x](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2246.html)
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
diff --git a/reference/algorithm/is_sorted_until.md b/reference/algorithm/is_sorted_until.md
@@ -111,6 +111,10 @@ ForwardIterator is_sorted_until(ForwardIterator first, ForwardIterator last)
 - [Visual C++](/implementation.md#visual_cpp): 2010 [mark verified], 2012 [mark verified], 2013 [mark verified], 2015 [mark verified]
 
 
+## 関連項目
+- [`ranges::is_sorted_until`](/reference/algorithm/ranges_is_sorted_until.md)
+
+
 ## 参照
 - [N2246 2 of the least crazy ideas for the standard library in C++0x](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2246.html)
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
diff --git a/reference/algorithm/lexicographical_compare.md b/reference/algorithm/lexicographical_compare.md
@@ -181,6 +181,10 @@ bool lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
 ```
 
 
+## 関連項目
+- [`ranges::lexicographical_compare`](/reference/algorithm/ranges_lexicographical_compare.md)
+
+
 ## 参照
 - [P0202R3 Add Constexpr Modifiers to Functions in `<algorithm>` and `<utility>` Headers](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0202r3.html)
 - [P0467R2 Iterator Concerns for Parallel Algorithms](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2017/p0467r2.html)
diff --git a/reference/algorithm/lower_bound.md b/reference/algorithm/lower_bound.md
@@ -262,6 +262,11 @@ lower_bound(ForwardIterator first, ForwardIterator last, const T& value)
 * std::advance[link /reference/iterator/advance.md]
 * std::iterator_traits[link /reference/iterator/iterator_traits.md]
 
+
+## 関連項目
+- [`ranges::lower_bound`](/reference/algorithm/ranges_lower_bound.md)
+
+
 ## 参照
 - [LWG Issue 384. `equal_range` has unimplementable runtime complexity](http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#384)
 - [LWG Issue 2150. Unclear specification of `find_end`](http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#2150)

diff --git a/reference/algorithm/make_heap.md b/reference/algorithm/make_heap.md
@@ -144,5 +144,9 @@ void make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare co
 * std::push_heap[link push_heap.md]
 
 
+## 関連項目
+- [`ranges::make_heap`](/reference/algorithm/ranges_make_heap.md)
+
+
 ## 参照
 - [P0879R0 Constexpr for `swap` and `swap` related functions](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2018/p0879r0.html)
diff --git a/reference/algorithm/max.md b/reference/algorithm/max.md
@@ -127,6 +127,10 @@ Windows環境においては、`<windows.h>`をインクルードすると`max`
 - `std::max()`を呼び出す際に、`(std::max)(a, b);`のように関数名をカッコで囲んで使用する。これで、名前解決において`std::max()`関数が必ず使用される。
 
 
+## 関連項目
+- [`ranges::max`](/reference/algorithm/ranges_max.md)
+
+
 ## 参照
 - [N2551 A Variadic `std::min(T, ...)` for the C++ Standard Library](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2551.pdf)
 - [N2772 Variadic functions: Variadic templates or initializer lists? -- Revision 1](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2772.pdf)