CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-11-02 05:36:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix(ru): align proofreading corrections with the Simplified Chinese original (#2004)

Browse Source 
* docs(ru): correct proofreading issues in prose and code examples

* docs(ru): align proofreading edits with Simplified Chinese source

* fix(ru): repair generated Zig statements and complete comment translations
This commit is contained in:
Yudong Jin
2026-10-27 18:19:11 +08:00
committed by GitHub
parent 350f483801
commit 71a773df64
149 changed files with 675 additions and 649 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
ru/codes/python/chapter_divide_and_conquer/binary_search_recur.py
View File

@@ -6,7 +6,7 @@ Author: krahets (krahets@163.com)
def dfs(nums: list[int], target: int, i: int, j: int) -> int:
"""Бинарный поиск: задача f(i, j)"""
"""Двоичный поиск: задача f(i, j)"""
# Если интервал пуст, целевой элемент отсутствует, вернуть -1
if i > j:
return -1
@@ -24,7 +24,7 @@ def dfs(nums: list[int], target: int, i: int, j: int) -> int:
def binary_search(nums: list[int], target: int) -> int:
"""Бинарный поиск"""
"""Двоичный поиск"""
n = len(nums)
# Решить задачу f(0, n-1)
return dfs(nums, target, 0, n - 1)
@@ -35,6 +35,6 @@ if __name__ == "__main__":
target = 6
nums = [1, 3, 6, 8, 12, 15, 23, 26, 31, 35]
# Бинарный поиск (двусторонне замкнутый интервал)
# Двоичный поиск (замкнутый интервал)
index = binary_search(nums, target)
print("Индекс целевого элемента 6 = ", index)