From b0c4efa706896c866212910c9ff480c3693659bd Mon Sep 17 00:00:00 2001
From: Yudong Jin <krahets@163.com>
Date: Wed, 11 Jan 2023 19:43:49 +0800
Subject: [PATCH] Update time_complexity.md

---
 docs/chapter_computational_complexity/time_complexity.md | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/docs/chapter_computational_complexity/time_complexity.md b/docs/chapter_computational_complexity/time_complexity.md
index 92f5a519..09aee7b7 100644
--- a/docs/chapter_computational_complexity/time_complexity.md
+++ b/docs/chapter_computational_complexity/time_complexity.md
@@ -355,8 +355,8 @@ $$
             print(0)
         }
     }
-
     ```
+
 ![time_complexity_first_example](time_complexity.assets/time_complexity_first_example.png)
 
 <p align="center"> Fig. 算法 A, B, C 的时间增长趋势 </p>
@@ -725,7 +725,6 @@ $$
     }
     ```
 
-
 ### 2. 判断渐近上界
 
 **时间复杂度由多项式 $T(n)$ 中最高阶的项来决定**。这是因为在 $n$ 趋于无穷大时，最高阶的项将处于主导作用，其它项的影响都可以被忽略。