algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-04 06:07:20 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix(sort): add c codes

Browse Source
This commit is contained in:
reanon
2023-01-18 14:20:42 +08:00
parent 744a37925f
commit d4d11d9f7d
2 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -7,7 +7,7 @@
#include "../include/include.h" #include "../include/include.h"
/* 元素交换 */ /* 元素交换 */
static void swap(int nums[], int i, int j) { void swap(int nums[], int i, int j) {
int tmp = nums[i]; int tmp = nums[i];
nums[i] = nums[j]; nums[i] = nums[j];
nums[j] = tmp; nums[j] = tmp;

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

@ -42,7 +42,7 @@ void countSort(int nums[], int size, int exp) {
} }
/* 基数排序 */ /* 基数排序 */
static void radixSort(int nums[], int size) { void radixSort(int nums[], int size) {
// 获取数组的最大元素，用于判断最大位数 // 获取数组的最大元素，用于判断最大位数
int max = INT32_MIN; int max = INT32_MIN;
for (size_t i = 0; i < size - 1; i++) { for (size_t i = 0; i < size - 1; i++) {