Commit ca85093

authored

Update article.md

fixed typo

1 parent 07784d8 commit ca85093Copy full SHA for ca85093

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -337,7 +337,7 @@ As we can see, when our function gets a department to sum, there are two possibl`
`337`	`337`
`338`	`338`	`The 1st case is the base of recursion, the trivial case, when we get an array.`
`339`	`339`
`340`		`-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).`
	`340`	`+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).`
`341`	`341`
`342`	`342`	`The algorithm is probably even easier to read from the code:`
`343`	`343`

Comments

(0)