CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-14 02:10:37 +08:00
Code Issues Packages Projects Releases Wiki Activity

[Rust] Normalize mid calculation in case overflow (#1363)

Browse Source 
* Normalize mid calculate in case overflow

* Change ALL language

* Update merge_sort.py

* Update merge_sort.zig

* Update binary_search_tree.zig

* Update binary_search_recur.py

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
rongyi
2024-05-18 18:19:19 +08:00
committed by GitHub
parent 0e221540a3
commit 21be3fdaf8
41 changed files with 57 additions and 59 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
en/codes/cpp/chapter_divide_and_conquer/binary_search_recur.cpp
View File

@@ -13,7 +13,7 @@ int dfs(vector<int> &nums, int target, int i, int j) {
return -1;
}
// Calculate midpoint index m
int m = (i + j) / 2;
int m = i + (j - i) / 2;
if (nums[m] < target) {
// Recursive subproblem f(m+1, j)
return dfs(nums, target, m + 1, j);
@@ -43,4 +43,4 @@ int main() {
cout << "Index of target element 6 =" << index << endl;
return 0;
}
}