CodeCow/freeCodeCamp
1
0
Fork 0
mirror of https://github.com/freeCodeCamp/freeCodeCamp.git synced 2026-06-28 21:00:56 +08:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity

fix(curriculum): revise sentence in Searching and Sorting Algorithms Review (#64262)

Browse Source
This commit is contained in:
Diem-Trang Pham 2025-12-01 13:45:46 -06:00 committed by GitHub
parent b6c2373d20
commit 091adf3875
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
curriculum/challenges/english/blocks/review-searching-and-sorting-algorithms/67f39de5ff88202c94798189.md
View File

@ -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.