camera-2018 · camera-2018 · Oct 26, 2024 · Oct 26, 2024
diff --git a/2.编程模块/2.1 NekoBytes-TheMissing/2.1.1 Book/6.算法导论.md b/2.编程模块/2.1 NekoBytes-TheMissing/2.1.1 Book/6.算法导论.md
diff --git a/...sing/2.1.1 Book/static/bubble_time_be_like_435e65ac16147d4efa46fab27c6d4589.png b/...sing/2.1.1 Book/static/bubble_time_be_like_435e65ac16147d4efa46fab27c6d4589.png
diff --git a/...Bytes-TheMissing/2.1.1 Book/static/funtion_6213b75654b0093279c4a1fbbf214ff6.png b/...Bytes-TheMissing/2.1.1 Book/static/funtion_6213b75654b0093279c4a1fbbf214ff6.png
diff --git a/...2.1 NekoBytes-TheMissing/2.1.1 Book/static/juejuezi_493f31cea98276cf6721352b13d25614.webp b/...2.1 NekoBytes-TheMissing/2.1.1 Book/static/juejuezi_493f31cea98276cf6721352b13d25614.webp
diff --git a/...ing/2.1.1 Book/static/merge19_time_be_like_d1f2cf2349719ef4a71be7f8d11047d2.png b/...ing/2.1.1 Book/static/merge19_time_be_like_d1f2cf2349719ef4a71be7f8d11047d2.png
diff --git a/...TheMissing/2.1.1 Book/static/merge_be_like_cc0051b03ba3196f9e1690405a34ed58.png b/...TheMissing/2.1.1 Book/static/merge_be_like_cc0051b03ba3196f9e1690405a34ed58.png
diff --git a/...ssing/2.1.1 Book/static/merge_sort_be_like_988c3ceb076ca69597b84b85949b35bd.png b/...ssing/2.1.1 Book/static/merge_sort_be_like_988c3ceb076ca69597b84b85949b35bd.png
diff --git a/...ssing/2.1.1 Book/static/merge_time_be_like_dfcfd2bd4e35b8fed9b27cd14ae845b0.png b/...ssing/2.1.1 Book/static/merge_time_be_like_dfcfd2bd4e35b8fed9b27cd14ae845b0.png
diff --git a/...issing/2.1.1 Book/static/recursion_be_like_efbc2ea49911eb91dcfee1fae0c36ea0.png b/...issing/2.1.1 Book/static/recursion_be_like_efbc2ea49911eb91dcfee1fae0c36ea0.png
diff --git a/...Bytes-TheMissing/2.1.1 Book/static/sort_time_be_like_79f92af94e2ba841658625622154b071.ods b/...Bytes-TheMissing/2.1.1 Book/static/sort_time_be_like_79f92af94e2ba841658625622154b071.ods
diff --git a/...heMissing/2.1.1 Book/static/treeofdividing_782dd1d9eb96efa63a6b52a477e6d083.png b/...heMissing/2.1.1 Book/static/treeofdividing_782dd1d9eb96efa63a6b52a477e6d083.png
diff --git a/2.编程模块/2.1 NekoBytes-TheMissing/2.1.2 Lab/4.Lab4.md b/2.编程模块/2.1 NekoBytes-TheMissing/2.1.2 Lab/4.Lab4.md
@@ -0,0 +1,45 @@
+# Lab4: 算法入门
+
+> [!IMPORTANT]
+> 开始 Lab4 前请确保提交了 Lab3，请使用`git commit --all`进行提交
+>
+> 使用 `git pull` 更新任务仓库
+>
+> 你可能需要使用`git pull --rebase`来[处理分支冲突](https://git-scm.com/book/zh/v2/Git-%e5%88%86%e6%94%af-%e5%8f%98%e5%9f%ba)
+
+## 1. 汉诺塔
+
+### 实验目的
+
+- 理解递归，认识递归的强大
+- 实践分治算法的设计过程
+
+### 实验要求
+
+根据 hanoi 目录下的 README.md 完成实验
+
+### 实验思考
+
+请在完成该实验后思考以下问题：
+
+1. 你的代码给出的操作步数是最少的吗？你能利用数学归纳法证明最少操作步数与塔的层数的关系吗？
+2. 尝试绘制 n=3 时的递归树，理解递归的过程。
+
+## 2. 矩阵乘法
+
+### 实验目的
+
+- 认清时间复杂度和实际运行时间的关系与差异
+- 认识递归的劣势
+- 学习调用函数的方法（即使在不清楚函数实现原理的情况下）
+
+### 实验要求
+
+根据 matrix 目录下的 README.md 完成实验
+
+### 实验思考
+
+请在完成该实验后思考以下问题：
+
+1. 在程序出错时，你有尝试使用输出信息进行调试吗？
+2. 为什么时间复杂度更优的算法运行起来更慢？简要浏览 matrix_function.c,怀着疑问准备下一周的学习。
diff --git a/components/CourseTable.vue b/components/CourseTable.vue
@@ -183,14 +183,15 @@ const courses = [
         lecture: {
           title: "4. 算法导论",
           links: {
-            slide: "",
+            slide: "https://e1psycongroo.github.io/NekoBytes-TheMissing/Lectures/Lecture4/Lecture4/index.html",
             recording: "",
-            note: "",
+            note: "/2.编程模块/2.1 NekoBytes-TheMissing/2.1.1 Book/6.算法导论",
+            code: "https://e1psycongroo.github.io/NekoBytes-TheMissing/_site/resources/Lecture4/Codes"
           },
         },
         lab: {
-          title: "No lab",
-          link: "",
+          title: "Lab4: 算法入门",
+          link: "/2.编程模块/2.1 NekoBytes-TheMissing/2.1.2 Lab/4.Lab4",
         },
         project: {
           title: "No Project",