From d4d11d9f7d69b2d6c918d555ac2bd97cf0a3dae6 Mon Sep 17 00:00:00 2001
From: reanon <793584285@qq.com>
Date: Wed, 18 Jan 2023 14:20:42 +0800
Subject: [PATCH] fix(sort): add c codes

---
 codes/c/chapter_sorting/quick_sort.c | 2 +-
 codes/c/chapter_sorting/radix_sort.c | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/codes/c/chapter_sorting/quick_sort.c b/codes/c/chapter_sorting/quick_sort.c
index c860c432f..f3c7498c2 100644
--- a/codes/c/chapter_sorting/quick_sort.c
+++ b/codes/c/chapter_sorting/quick_sort.c
@@ -7,7 +7,7 @@
 #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];
     nums[i] = nums[j];
     nums[j] = tmp;
diff --git a/codes/c/chapter_sorting/radix_sort.c b/codes/c/chapter_sorting/radix_sort.c
index 4574ea8a2..31b940dc3 100644
--- a/codes/c/chapter_sorting/radix_sort.c
+++ b/codes/c/chapter_sorting/radix_sort.c
@@ -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;
     for (size_t i = 0; i < size - 1; i++) {