diff --git a/docs/chapter_computational_complexity/iteration_and_recursion.md b/docs/chapter_computational_complexity/iteration_and_recursion.md index 0ce5a2b75..ffefa7050 100644 --- a/docs/chapter_computational_complexity/iteration_and_recursion.md +++ b/docs/chapter_computational_complexity/iteration_and_recursion.md @@ -1,6 +1,6 @@ # 迭代与递归 -在数据结构与算法中,重复执行某个任务是很常见的,其与算法的复杂度密切相关。而要重复执行某个任务,我们通常会选用两种基本的程序结构:迭代和递归。 +在算法中,重复执行某个任务是很常见的,其与复杂度分析息息相关。因此,在展开介绍时间复杂度和空间复杂度之前,我们先来了解如何在程序中实现重复执行任务,即两种基本的程序控制结构:迭代、递归。 ## 迭代 diff --git a/mkdocs.yml b/mkdocs.yml index 41d482530..5d3ad56d9 100644 --- a/mkdocs.yml +++ b/mkdocs.yml @@ -60,7 +60,7 @@ theme: text: Noto Sans SC code: Fira Code favicon: assets/images/favicon.png - logo: assets/images/logo.png + logo: assets/images/logo.svg icon: logo: logo repo: fontawesome/brands/github diff --git a/overrides/assets/images/favicon.png b/overrides/assets/images/favicon.png index 285fefc97..232242831 100644 Binary files a/overrides/assets/images/favicon.png and b/overrides/assets/images/favicon.png differ diff --git a/overrides/assets/images/logo.svg b/overrides/assets/images/logo.svg new file mode 100644 index 000000000..17aeab49e --- /dev/null +++ b/overrides/assets/images/logo.svg @@ -0,0 +1,36 @@ + + + + + + + + + + + + + + + + + + + + + + + + \ No newline at end of file