CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-23 18:11:45 +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/c/chapter_sorting/bubble_sort.c
View File

@@ -10,7 +10,7 @@
void bubbleSort(int nums[], int size) {
// 外循环：未排序区间为 [0, i]
for (int i = 0; i < size - 1; i++) {
// 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端
// 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端
for (int j = 0; j < size - 1 - i; j++) {
if (nums[j] > nums[j + 1]) {
int temp = nums[j];
@@ -26,7 +26,7 @@ void bubbleSortWithFlag(int nums[], int size) {
// 外循环：未排序区间为 [0, i]
for (int i = 0; i < size - 1; i++) {
bool flag = false;
// 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端
// 内循环：将未排序区间 [0, i] 中的最大元素交换至该区间的最右端
for (int j = 0; j < size - 1 - i; j++) {
if (nums[j] > nums[j + 1]) {
int temp = nums[j];

2
codes/c/chapter_sorting/selection_sort.c
View File

@@ -14,7 +14,7 @@ void selectionSort(int nums[], int n) {
int k = i;
for (int j = i + 1; j < n; j++) {
if (nums[j] < nums[k])
k = j; // 记录最小元素的索引
k = j; // 记录最小元素的索引
}
// 将该最小元素与未排序区间的首个元素交换
int temp = nums[i];