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

Format C, C++, C#, Go, Java, Python, Rust code.

Browse Source
This commit is contained in:
krahets
2023-09-02 23:54:38 +08:00
parent b6ac6aa7d7
commit dd72335235
53 changed files with 152 additions and 154 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/python/chapter_sorting/bubble_sort.py
View File

@@ -10,7 +10,7 @@ def bubble_sort(nums: list[int]):
n = len(nums)
# 外循环：未排序区间为 [0, i]
for i in range(n - 1, 0, -1):
# 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端
# 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端
for j in range(i):
if nums[j] > nums[j + 1]:
# 交换 nums[j] 与 nums[j + 1]
@@ -23,7 +23,7 @@ def bubble_sort_with_flag(nums: list[int]):
# 外循环：未排序区间为 [0, i]
for i in range(n - 1, 0, -1):
flag = False # 初始化标志位
# 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端
# 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端
for j in range(i):
if nums[j] > nums[j + 1]:
# 交换 nums[j] 与 nums[j + 1]

2
codes/python/chapter_sorting/heap_sort.py
View File

@@ -36,7 +36,7 @@ def heap_sort(nums: list[int]):
nums[0], nums[i] = nums[i], nums[0]
# 以根节点为起点，从顶至底进行堆化
sift_down(nums, i, 0)
"""Driver Code"""
if __name__ == "__main__":