diff --git a/codes/c/chapter_sorting/bubble_sort.c b/codes/c/chapter_sorting/bubble_sort.c
index 6b67bd727..5c74d9e4e 100644
--- a/codes/c/chapter_sorting/bubble_sort.c
+++ b/codes/c/chapter_sorting/bubble_sort.c
@@ -7,8 +7,7 @@
 #include "../include/include.h"
 
 /* 冒泡排序 */
-void bubble_sort(int nums[], int size)
-{
+void bubble_sort(int nums[], int size) {
     // 外循环：待排序元素数量为 n-1, n-2, ..., 1
     for (int i = 0; i < size - 1; i++)
     {
@@ -26,8 +25,7 @@ void bubble_sort(int nums[], int size)
 }
 
 /* 冒泡排序（标志优化）*/
-void bubble_sort_with_flag(int nums[], int size)
-{
+void bubble_sort_with_flag(int nums[], int size) {
     // 外循环：待排序元素数量为 n-1, n-2, ..., 1
     for (int i = 0; i < size - 1; i++)
     {
@@ -50,8 +48,7 @@ void bubble_sort_with_flag(int nums[], int size)
 
 
 /* Driver Code */
-int main()
-{
+int main() {
     int nums[6] = {4, 1, 3, 1, 5, 2};
     printf("冒泡排序后:\n");
     bubble_sort(nums, 6);
@@ -69,4 +66,4 @@ int main()
     printf("\n");
 
     return 0;
-}
\ No newline at end of file
+}
diff --git a/codes/c/chapter_sorting/insertion_sort.c b/codes/c/chapter_sorting/insertion_sort.c
index ae1f6e7de..318a40278 100644
--- a/codes/c/chapter_sorting/insertion_sort.c
+++ b/codes/c/chapter_sorting/insertion_sort.c
@@ -7,8 +7,7 @@
 #include "../include/include.h"
 
 /* 插入排序 */
-void insertionSort(int nums[], int size)
-{
+void insertionSort(int nums[], int size) {
     // 外循环：base = nums[1], nums[2], ..., nums[n-1]
     for (int i = 1; i < size; i++)
     {
@@ -26,8 +25,7 @@ void insertionSort(int nums[], int size)
 }
 
 /* Driver Code */
-int main()
-{
+int main() {
     int nums[] = {4, 1, 3, 1, 5, 2};
     insertionSort(nums, 6);
     printf("插入排序完成后 nums = \n");
diff --git a/docs/chapter_sorting/bubble_sort.md b/docs/chapter_sorting/bubble_sort.md
index 336f3c2d5..bb35fabe4 100644
--- a/docs/chapter_sorting/bubble_sort.md
+++ b/docs/chapter_sorting/bubble_sort.md
@@ -170,8 +170,7 @@ comments: true
 
     ```c title="bubble_sort.c"
     /* 冒泡排序 */
-    void bubble_sort(int nums[], int size)
-    {
+    void bubble_sort(int nums[], int size) {
         // 外循环：待排序元素数量为 n-1, n-2, ..., 1
         for (int i = 0; i < size - 1; i++)
         {
@@ -368,8 +367,7 @@ comments: true
 
     ```c title="bubble_sort.c"
     /* 冒泡排序 */
-    void bubble_sort(int nums[], int size)
-    {
+    void bubble_sort(int nums[], int size) {
         // 外循环：待排序元素数量为 n-1, n-2, ..., 1
         for (int i = 0; i < size - 1; i++)
         {
diff --git a/docs/chapter_sorting/insertion_sort.md b/docs/chapter_sorting/insertion_sort.md
index faaf38358..85016f718 100644
--- a/docs/chapter_sorting/insertion_sort.md
+++ b/docs/chapter_sorting/insertion_sort.md
@@ -136,8 +136,7 @@ comments: true
 
     ```c title="insertion_sort.c"
     /* 插入排序 */
-    void insertionSort(int nums[], int size)
-    {
+    void insertionSort(int nums[], int size) {
         // 外循环：base = nums[1], nums[2], ..., nums[n-1]
         for (int i = 1; i < size; i++)
         {