From 12febe5cc2c4469d96b6a3292289d4fed44c72af Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?=D8=B3=D9=84=D9=8A=D9=85=D8=A7=D9=86=20=D8=A7=D9=84=D8=B3?= =?UTF-8?q?=D9=87=D9=85=D9=8A=20=28Soula=C3=AFmane=20Sahmi=29?= Date: Sat, 28 Oct 2017 05:15:06 +0000 Subject: [PATCH] Perhaps you mean O(n) space (#1871) --- pkgs/racket-doc/scribblings/guide/lists.scrbl | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/pkgs/racket-doc/scribblings/guide/lists.scrbl b/pkgs/racket-doc/scribblings/guide/lists.scrbl index 663031eadc..521a574cc1 100644 --- a/pkgs/racket-doc/scribblings/guide/lists.scrbl +++ b/pkgs/racket-doc/scribblings/guide/lists.scrbl @@ -195,7 +195,7 @@ of recursive calls instead of a looping construct, then read on. @section[#:tag "tail-recursion"]{Tail Recursion} Both the @racket[my-length] and @racket[my-map] functions run in -@math{O(n)} time for a list of length @math{n}. This is easy to see by +@math{O(n)} space for a list of length @math{n}. This is easy to see by imagining how @racket[(my-length (list "a" "b" "c"))] must evaluate: @racketblock[