From ca8509318194b02bd7a10cb300ac6b8f5ed75bc0 Mon Sep 17 00:00:00 2001 From: Vim Shah Date: Mon, 19 Aug 2019 18:17:44 -0700 Subject: [PATCH] Update article.md fixed typo --- 1-js/06-advanced-functions/01-recursion/article.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/1-js/06-advanced-functions/01-recursion/article.md b/1-js/06-advanced-functions/01-recursion/article.md index 5b73b333..b7758236 100644 --- a/1-js/06-advanced-functions/01-recursion/article.md +++ b/1-js/06-advanced-functions/01-recursion/article.md @@ -337,7 +337,7 @@ As we can see, when our function gets a department to sum, there are two possibl The 1st case is the base of recursion, the trivial case, when we get an array. -The 2nd case when we gen an object is the recursive step. A complex task is split into subtasks for smaller departments. They may in turn split again, but sooner or later the split will finish at (1). +The 2nd case when we get an object is the recursive step. A complex task is split into subtasks for smaller departments. They may in turn split again, but sooner or later the split will finish at (1). The algorithm is probably even easier to read from the code: