From 3d54211e6eddc2f2586b9a20543754947c7ad325 Mon Sep 17 00:00:00 2001
From: Allen Guo <guoguo12@gmail.com>
Date: Tue, 12 May 2020 18:54:18 -0400
Subject: [PATCH] Fix Wikipedia link (GH-20031)

---
 Doc/library/functools.rst | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/Doc/library/functools.rst b/Doc/library/functools.rst
index 204e66ae5ac..a44eb85b27d 100644
--- a/Doc/library/functools.rst
+++ b/Doc/library/functools.rst
@@ -158,11 +158,11 @@ The :mod:`functools` module defines the following functions:
    bypassing the cache, or for rewrapping the function with a different cache.
 
    An `LRU (least recently used) cache
-   <https://en.wikipedia.org/wiki/Cache_algorithms#Examples>`_ works
-   best when the most recent calls are the best predictors of upcoming calls (for
-   example, the most popular articles on a news server tend to change each day).
-   The cache's size limit assures that the cache does not grow without bound on
-   long-running processes such as web servers.
+   <https://en.wikipedia.org/wiki/Cache_replacement_policies#Least_recently_used_(LRU)>`_
+   works best when the most recent calls are the best predictors of upcoming
+   calls (for example, the most popular articles on a news server tend to
+   change each day).  The cache's size limit assures that the cache does not
+   grow without bound on long-running processes such as web servers.
 
    In general, the LRU cache should only be used when you want to reuse
    previously computed values.  Accordingly, it doesn't make sense to cache