Skip to content

Commit 511d897

Browse files
committed
ch8: fixing improper chapter cross-ref, per #121
1 parent 2437c70 commit 511d897

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

ch8.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -261,7 +261,7 @@ Next, we turn our attention to checking `num1` against `maxRest` -- the main log
261261

262262
The case I'm making is that this reasoning while reading an implementation is more straightforward, with fewer nuances or noise to distract us, than the imperative approach; it's **more declarative** than the `for`-loop with `-Infinity` approach.
263263

264-
**Tip:** We should point out that another (likely better!) way to model this besides manual iteration or recursion would be with list operations like we discussed in Chapter 7. The list of numbers could first be `filter(..)`ed to include only evens, and then finding the max is a `reduce(..)` that simply compares two numbers and returns the bigger of the two. We only used this example to illustrate the more declarative nature of recursion over manual iteration.
264+
**Tip:** We should point out that another (likely better!) way to model this besides manual iteration or recursion would be with list operations (see Chapter 9), with a `filter(..)` to include only evens and then a `reduce(..)` to find the max. We only used this example to illustrate the more declarative nature of recursion over manual iteration.
265265

266266
### Binary Tree Recursion
267267

0 commit comments

Comments
 (0)