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

feat: add C counting_sort (#430)

Browse Source 
* feat: add C counting_sort

* Update CMakeLists.txt

---------

Co-authored-by: Yudong Jin <krahets@163.com>
This commit is contained in:
Guanngxu
2023-03-20 21:25:03 +08:00
committed by GitHub
parent 0659c54e77
commit e539c44f63
2 changed files with 8 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/c/chapter_sorting/CMakeLists.txt
View File

@ -1,5 +1,5 @@
add_executable(bubble_sort bubble_sort.c) add_executable(bubble_sort bubble_sort.c)
add_executable(counting_sort counting_sort.c)
add_executable(insertion_sort insertion_sort.c) add_executable(insertion_sort insertion_sort.c)
add_executable(quick_sort quick_sort.c) add_executable(quick_sort quick_sort.c)
add_executable(radix_sort radix_sort.c) add_executable(counting_sort counting_sort.c)
add_executable(radix_sort radix_sort.c)

13
codes/c/chapter_sorting/counting_sort.c
View File

@ -1,8 +1,9 @@
/** /**
* File: counting_sort.c * File: counting_sort.c
* Created Time: 2023-03-20 * Created Time: 2023-03-20
* Author: Reanon (793584285@qq.com) * Author: Reanon (793584285@qq.com), Guanngxu (446678850@qq.com)
*/ */
#include "../include/include.h" #include "../include/include.h"
/* 计数排序 */ /* 计数排序 */
@ -30,7 +31,6 @@ void countingSortNaive(int nums[], int size) {
} }
} }
/* 计数排序 */ /* 计数排序 */
// 完整实现，可排序对象，并且是稳定排序 // 完整实现，可排序对象，并且是稳定排序
void countingSort(int nums[], int size) { void countingSort(int nums[], int size) {
@ -57,10 +57,8 @@ void countingSort(int nums[], int size) {
int *res = malloc(sizeof(int) * size); int *res = malloc(sizeof(int) * size);
for (int i = size - 1; i >= 0; i--) { for (int i = size - 1; i >= 0; i--) {
int num = nums[i]; int num = nums[i];
// 将 num 放置到对应索引处 res[counter[num] - 1] = num; // 将 num 放置到对应索引处
res[counter[num] - 1] = num; counter[num]--; // 令前缀和自减 1 ，得到下次放置 num 的索引
// 令前缀和自减 1 ，得到下次放置 num 的索引
counter[num]--;
} }
// 使用结果数组 res 覆盖原数组 nums // 使用结果数组 res 覆盖原数组 nums
memcpy(nums, res, size * sizeof(int)); memcpy(nums, res, size * sizeof(int));
@ -77,5 +75,6 @@ int main() {
countingSort(nums, size); countingSort(nums, size);
printf("计数排序完成后 nums = "); printf("计数排序完成后 nums = ");
printArray(nums, size); printArray(nums, size);
return 0; return 0;
} }