diff --git a/codes/javascript/chapter_computational_complexity/time_complexity.js b/codes/javascript/chapter_computational_complexity/time_complexity.js
index c8809caa..2e4688dd 100644
--- a/codes/javascript/chapter_computational_complexity/time_complexity.js
+++ b/codes/javascript/chapter_computational_complexity/time_complexity.js
@@ -118,6 +118,8 @@ function factorialRecur(n) {
     return count;
 }
 
+/* Driver Code */
+// 可以修改 n 运行，体会一下各种复杂度的操作数量变化趋势
 const n = 8;
 console.log("输入数据大小 n = " + n);