algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-07-06 22:34:18 +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

2
en/codes/python/chapter_sorting/merge_sort.py
View File

@ -41,7 +41,7 @@ def merge_sort(nums: list[int], left: int, right: int):
if left >= right:
return # Terminate recursion when subarray length is 1
# Partition stage
mid = (left + right) // 2 # Calculate midpoint
mid = left + (right - left) // 2 # Calculate midpoint
merge_sort(nums, left, mid) # Recursively process the left subarray
merge_sort(nums, mid + 1, right) # Recursively process the right subarray
# Merge stage