jeena/en.javascript.info
1
0
Fork 0
Code Issues Pull requests Projects Packages Wiki Activity Actions

Update article.md

Browse source 
fixed typo
This commit is contained in:
Vim Shah 2019-08-19 18:17:44 -07:00 • committed by GitHub
parent 07784d8cfa
commit ca85093181
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

2
1-js/06-advanced-functions/01-recursion/article.md
View file

@ -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 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: The algorithm is probably even easier to read from the code: