xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-14 08:06:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

Polish some contents.

Browse Source
This commit is contained in:
krahets
2023-05-24 11:45:52 +08:00
parent 38c56b581a
commit dc49fdf75e
5 changed files with 17 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/cpp/chapter_sorting/selection_sort.cpp
+3 -4
View File
@@ -11,12 +11,11 @@ void selectionSort(vector<int> &nums) {
int n = nums.size();
// 外循环：未排序区间为 [i, n-1]
for (int i = 0; i < n - 1; i++) {
// 内循环：找到未排序区间 [i, n-1] 中的最小元素
// 内循环：找到未排序区间内的最小元素
int k = i;
for (int j = i + 1; j < n; j++) {
if (nums[j] < nums[k]) {
k = j; // 更新最小元素
}
if (nums[j] < nums[k])
k = j; // 记录最小元素的索引
}
// 将该最小元素与未排序区间的首个元素交换
swap(nums[i], nums[k]);
codes/java/chapter_sorting/selection_sort.java
+3 -4
View File
@@ -14,12 +14,11 @@ public class selection_sort {
int n = nums.length;
// 外循环：未排序区间为 [i, n-1]
for (int i = 0; i < n - 1; i++) {
// 内循环：找到未排序区间 [i, n-1] 中的最小元素
// 内循环：找到未排序区间内的最小元素
int k = i;
for (int j = i + 1; j < n; j++) {
if (nums[j] < nums[k]) {
k = j; // 更新最小元素
}
if (nums[j] < nums[k])
k = j; // 记录最小元素的索引
}
// 将该最小元素与未排序区间的首个元素交换
int temp = nums[i];
codes/python/chapter_sorting/selection_sort.py
+2 -2
View File
@@ -10,11 +10,11 @@ def selection_sort(nums: list[int]):
n = len(nums)
# 外循环：未排序区间为 [i, n-1]
for i in range(n - 1):
# 内循环：找到未排序区间 [i, n-1] 中的最小元素
# 内循环：找到未排序区间内的最小元素
k = i
for j in range(i + 1, n):
if nums[j] < nums[k]:
k = j # 更新最小元素
k = j # 记录最小元素的索引
# 将该最小元素与未排序区间的首个元素交换
nums[i], nums[k] = nums[k], nums[i]