@@ -348,11 +348,11 @@ context from the stack, and uses it to continue execution.
348348(((stack overflow)))(((recursion)))This stack requires space in the
349349computer's memory to be stored. When the stack grows too big, the
350350computer will give up with a message like “out of stack space” or “too
351- much recursion.” The following code illustrates that—it asks the
351+ much recursion”. The following code illustrates that—it asks the
352352computer a really hard question, which causes an infinite
353353back-and-forth between two functions. Or rather, it would be infinite,
354354if we had an infinite stack. As it is, it will run out of space, or
355- “blow the stack.”
355+ “blow the stack”.
356356
357357// test: no
358358
@@ -380,7 +380,7 @@ alert("Hello", "Good Evening", "How do you do?");
380380
381381(((alert function)))The function `alert` officially accepts only one
382382argument. Yet when you call it like this, it does not complain. It
383- simply ignores the other arguments and shows you “Hello.”
383+ simply ignores the other arguments and shows you “Hello”.
384384
385385(((undefined value)))JavaScript is extremely broad-minded about the
386386amount of arguments you pass to a function. If you pass too many, the
@@ -568,7 +568,7 @@ marginally faster.
568568Regardless, recursion is not always just a less-efficient alternative
569569to looping. Some problems are much easier to solve with recursion than
570570with loops. Most often these are problems that require exploring or
571- processing several “branches,” each of which might branch out again
571+ processing several “branches”, each of which might branch out again
572572into more branches.
573573
574574Consider this puzzle: By starting from the number 1 and repeatedly
0 commit comments