Commit 78a6ffa

authored

Update article.md

Change to wording about maximum recursion depth.

1 parent 8c30654 commit 78a6ffaCopy full SHA for 78a6ffa

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -96,7 +96,7 @@ function pow(x, n) {`
`96`	`96`
`97`	`97`	The maximal number of nested calls (including the first one) is called recursion depth. In our case, it will be exactly `n`.
`98`	`98`
`99`		`-The maximal recursion depth is limited by JavaScript engine. We can make sure about 10000, some engines allow more, but 100000 is probably out of limit for the majority of them. There are automatic optimizations that help alleviate this ("tail calls optimizations"), but they are not yet supported everywhere and work only in simple cases.`
	`99`	`+The maximal recursion depth is limited by JavaScript engine. We can rely on it being 10000, some engines allow more, but 100000 is probably out of limit for the majority of them. There are automatic optimizations that help alleviate this ("tail calls optimizations"), but they are not yet supported everywhere and work only in simple cases.`
`100`	`100`
`101`	`101`	`That limits the application of recursion, but it still remains very wide. There are many tasks where recursive way of thinking gives simpler code, easier to maintain.`
`102`	`102`

Comments

(0)