summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorArtem Pelenitsyn <a.pelenitsyn@gmail.com>2019-03-23 13:18:12 -0400
committerMarge Bot <ben+marge-bot@smart-cactus.org>2019-03-29 14:18:20 -0400
commit754b5455aa0983c7702546a6c64061c95733997a (patch)
tree46f08cf62a12db1a45d5bc4fa54b093970114d15
parent8a20bfc21da6a47087c8069f92691629eb47951d (diff)
downloadhaskell-754b5455aa0983c7702546a6c64061c95733997a.tar.gz
docs: make nfib compute the Fibonacci sequence [skipci]
-rw-r--r--docs/users_guide/parallel.rst2
1 files changed, 1 insertions, 1 deletions
diff --git a/docs/users_guide/parallel.rst b/docs/users_guide/parallel.rst
index fea8fa4a57..6c2a7ae1c4 100644
--- a/docs/users_guide/parallel.rst
+++ b/docs/users_guide/parallel.rst
@@ -120,7 +120,7 @@ For example, consider the following parallel version of our old nemesis,
nfib :: Int -> Int
nfib n | n <= 1 = 1
- | otherwise = par n1 (pseq n2 (n1 + n2 + 1))
+ | otherwise = par n1 (pseq n2 (n1 + n2))
where n1 = nfib (n-1)
n2 = nfib (n-2)