github_mirrors/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-01-23 22:40:25 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update merge_sort.cs

Browse Source
This commit is contained in:
GN-Yu 2022-12-30 13:21:03 -05:00 committed by GitHub
parent a03353f8e2
commit 1b71e74baa
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
codes/csharp/chapter_sorting/merge_sort.cs
View File

@ -31,10 +31,10 @@ namespace hello_algo.chapter_sorting
// 若“左子数组已全部合并完”，则选取右子数组元素，并且 j++ // 若“左子数组已全部合并完”，则选取右子数组元素，并且 j++
if (i > leftEnd) if (i > leftEnd)
nums[k] = tmp[j++]; nums[k] = tmp[j++];
// 否则，若“右子数组已全部合并完”或“左子数组元素 < 右子数组元素”，则选取左子数组元素，并且 i++ // 否则，若“右子数组已全部合并完”或“左子数组元素 <= 右子数组元素”，则选取左子数组元素，并且 i++
else if (j > rightEnd || tmp[i] <= tmp[j]) else if (j > rightEnd || tmp[i] <= tmp[j])
nums[k] = tmp[i++]; nums[k] = tmp[i++];
// 否则，若“左子数组元素 > 右子数组元素”，则选取右子数组元素，并且 j++ // 否则，若“左右子数组都未全部合并完”且“左子数组元素 > 右子数组元素”，则选取右子数组元素，并且 j++
else else
nums[k] = tmp[j++]; nums[k] = tmp[j++];
} }