From 592965595e0ac7342b0da9cabf847ab1630aafc3 Mon Sep 17 00:00:00 2001
From: Yudong Jin <krahets@163.com>
Date: Fri, 3 Feb 2023 01:17:09 +0800
Subject: [PATCH] Fix code indentation.

---
 docs/chapter_computational_complexity/time_complexity.md | 4 ++--
 docs/chapter_sorting/insertion_sort.md                   | 2 +-
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/docs/chapter_computational_complexity/time_complexity.md b/docs/chapter_computational_complexity/time_complexity.md
index 6d10e400..d06fd27f 100644
--- a/docs/chapter_computational_complexity/time_complexity.md
+++ b/docs/chapter_computational_complexity/time_complexity.md
@@ -1406,8 +1406,8 @@ $$
 === "Go"
 
     ```go title="time_complexity.go"
-     /* 平方阶（冒泡排序） */
-     func bubbleSort(nums []int) int {
+    /* 平方阶（冒泡排序） */
+    func bubbleSort(nums []int) int {
         count := 0 // 计数器
         // 外循环：待排序元素数量为 n-1, n-2, ..., 1
         for i := len(nums) - 1; i > 0; i-- {
diff --git a/docs/chapter_sorting/insertion_sort.md b/docs/chapter_sorting/insertion_sort.md
index ec1fd4d8..b9a99512 100644
--- a/docs/chapter_sorting/insertion_sort.md
+++ b/docs/chapter_sorting/insertion_sort.md
@@ -157,7 +157,7 @@ comments: true
 === "C#"
 
     ```csharp title="insertion_sort.cs"
-     /* 插入排序 */
+    /* 插入排序 */
     void insertionSort(int[] nums)
     {
         // 外循环：base = nums[1], nums[2], ..., nums[n-1]