xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-25 12:16:29 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

Fine tune

Browse source
This commit is contained in:
Yudong Jin 2022-12-27 20:11:22 +08:00
parent edf1029ac4
commit 34ad07bfed
3 changed files with 10 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
codes/c/chapter_sorting/bubble_sort.c
View file

@ -48,6 +48,8 @@ void bubble_sort_with_flag(int nums[], int size)
}
}
/* Driver Code */
int main()
{
int nums[6] = {4, 1, 3, 1, 5, 2};

10
codes/cpp/chapter_sorting/bubble_sort.cpp
View file

@ -14,9 +14,8 @@ void bubbleSort(vector<int>& nums) {
for (int j = 0; j < i; j++) {
if (nums[j] > nums[j + 1]) {
// 交换 nums[j] 与 nums[j + 1]
int tmp = nums[j];
nums[j] = nums[j + 1];
nums[j + 1] = tmp;
// 这里使用了 std::swap() 函数
swap(nums[j], nums[j + 1]);
}
}
}
@ -31,9 +30,8 @@ void bubbleSortWithFlag(vector<int>& nums) {
for (int j = 0; j < i; j++) {
if (nums[j] > nums[j + 1]) {
// 交换 nums[j] 与 nums[j + 1]
int tmp = nums[j];
nums[j] = nums[j + 1];
nums[j + 1] = tmp;
// 这里使用了 std::swap() 函数
swap(nums[j], nums[j + 1]);
flag = true; // 记录交换元素
}
}

6
docs/chapter_sorting/bubble_sort.md
View file

@ -85,7 +85,8 @@ comments: true
for (int j = 0; j < i; j++) {
if (nums[j] > nums[j + 1]) {
// 交换 nums[j] 与 nums[j + 1]
std::swap(nums[j], nums[j+1]);
// 这里使用了 std::swap() 函数
swap(nums[j], nums[j + 1]);
}
}
}
@ -265,7 +266,8 @@ comments: true
for (int j = 0; j < i; j++) {
if (nums[j] > nums[j + 1]) {
// 交换 nums[j] 与 nums[j + 1]
std::swap(nums[j], nums[j+1]);
// 这里使用了 std::swap() 函数
swap(nums[j], nums[j + 1]);
flag = true; // 记录交换元素
}
}