From 5ec15c4a3e7482352456287f43f33afb6f1bc957 Mon Sep 17 00:00:00 2001
From: RafaelCaso <94573618+RafaelCaso@users.noreply.github.com>
Date: Mon, 11 Nov 2024 10:35:50 -0500
Subject: [PATCH] Update searching_algorithm_revisited.md

fix typo in original commit
---
 en/docs/chapter_searching/searching_algorithm_revisited.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/en/docs/chapter_searching/searching_algorithm_revisited.md b/en/docs/chapter_searching/searching_algorithm_revisited.md
index 98ae725dc..edee2ff28 100644
--- a/en/docs/chapter_searching/searching_algorithm_revisited.md
+++ b/en/docs/chapter_searching/searching_algorithm_revisited.md
@@ -38,7 +38,7 @@ However, **using these algorithms often requires data preprocessing**. For examp
 
 ## Choosing a search method
 
-Given a set of data of size $n$, we can use a linear search, binary search, tree search, hash search, or other method to retrieve the target element. The working principles of these methods are shown in the figure below.
+Given a set of data of size $n$, we can use a linear search, binary search, tree search, hash search, or other methods to retrieve the target element. The working principles of these methods are shown in the figure below.
 
 ![Various search strategies](searching_algorithm_revisited.assets/searching_algorithms.png)