From 091adf387592548adbf8d8b406604dff13b67136 Mon Sep 17 00:00:00 2001
From: Diem-Trang Pham <6422507+pdtrang@users.noreply.github.com>
Date: Mon, 1 Dec 2025 13:45:46 -0600
Subject: [PATCH] fix(curriculum): revise sentence in Searching and Sorting
 Algorithms Review (#64262)

---
 .../67f39de5ff88202c94798189.md                                 | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/curriculum/challenges/english/blocks/review-searching-and-sorting-algorithms/67f39de5ff88202c94798189.md b/curriculum/challenges/english/blocks/review-searching-and-sorting-algorithms/67f39de5ff88202c94798189.md
index 18a6a5b3899..357a6d42a32 100644
--- a/curriculum/challenges/english/blocks/review-searching-and-sorting-algorithms/67f39de5ff88202c94798189.md
+++ b/curriculum/challenges/english/blocks/review-searching-and-sorting-algorithms/67f39de5ff88202c94798189.md
@@ -25,7 +25,7 @@ In computer science, there are two searching algorithms you should know about. T
 ### Binary Search
 
 - Binary search works by dividing a list of items in half, and checking if the target value is in the middle of the list.
-- The condition for binary search to work is that the items in the list must be in ascending order.
+- The condition for binary search to work is that the items in the list must be sorted, either in ascending or descending order.
 - Binary search is a more efficient algorithm for searching through a large list of items because it divides the list of items in half and ignores any half where the target is not found.
 - If the target item is found in the middle of the list, the index of the target item is returned.
 - If the item is not found, the algorithm checks if the target item is in the left or right half of the list.