algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

Bug fixes and improvements (#1152)

Browse Source 
* Update avl_tree.md

* Remove the empty space

* Simplify the heading of the paperbook chapter

* Update hash_map_open_addressing.go to the latest version

* Improvements
This commit is contained in:
Yudong Jin
2024-03-18 13:34:02 +08:00
committed by GitHub
parent 6f1ec66949
commit 7f43f92ae9
15 changed files with 84 additions and 107 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/zig/chapter_sorting/bubble_sort.zig
View File

@ -11,7 +11,7 @@ fn bubbleSort(nums: []i32) void {
var i: usize = nums.len - 1;
while (i > 0) : (i -= 1) {
var j: usize = 0;
// 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端
// 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端
while (j < i) : (j += 1) {
if (nums[j] > nums[j + 1]) {
// 交换 nums[j] 与 nums[j + 1]
@ -30,7 +30,7 @@ fn bubbleSortWithFlag(nums: []i32) void {
while (i > 0) : (i -= 1) {
var flag = false; // 初始化标志位
var j: usize = 0;
// 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端
// 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端
while (j < i) : (j += 1) {
if (nums[j] > nums[j + 1]) {
// 交换 nums[j] 与 nums[j + 1]