From ca774eefbfb880141e3982a00b481c92fd4c32b1 Mon Sep 17 00:00:00 2001 From: YuZou Date: Wed, 4 Dec 2024 17:36:11 +0800 Subject: [PATCH] Update time_complexity.md (#1578) * Bug fixes and improvements (#1577) * correct the implement of exp_recur function and remove +1 operation from the function to simulate the cell division process * Update time_complexity.rs * Update time_complexity.md --------- Co-authored-by: zouy26 Co-authored-by: Yudong Jin --- docs/chapter_computational_complexity/time_complexity.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/docs/chapter_computational_complexity/time_complexity.md b/docs/chapter_computational_complexity/time_complexity.md index 88c019bc4..4dae586ae 100755 --- a/docs/chapter_computational_complexity/time_complexity.md +++ b/docs/chapter_computational_complexity/time_complexity.md @@ -1120,7 +1120,7 @@ $$ 生物学的“细胞分裂”是指数阶增长的典型例子：初始状态为 $1$ 个细胞，分裂一轮后变为 $2$ 个，分裂两轮后变为 $4$ 个，以此类推，分裂 $n$ 轮后有 $2^n$ 个细胞。 -下图和以下代码模拟了细胞分裂的过程，时间复杂度为 $O(2^n)$ ： +下图和以下代码模拟了细胞分裂的过程，时间复杂度为 $O(2^n)$ 。请注意，输入 $n$ 表示分裂轮数，返回值 `count` 表示总分裂次数。 ```src [file]{time_complexity}-[class]{}-[func]{exponential}