Perhaps you mean O(n) space (#1871)

2017-10-28 05:15:06 +00:00 · 2017-10-28 05:15:06 +00:00 · 12febe5cc2
commit 12febe5cc2
parent 9b1c71a381
1 changed files with 1 additions and 1 deletions
--- 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[