suzanne.soy/racket
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
سليمان السهمي (Soulaïmane Sahmi) 2017-10-28 05:15:06 +00:00 committed by Ben Greenman
parent 9b1c71a381
commit 12febe5cc2
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
pkgs/racket-doc/scribblings/guide/lists.scrbl
View File

@ -195,7 +195,7 @@ of recursive calls instead of a looping construct, then read on.
@section[#:tag "tail-recursion"]{Tail Recursion} @section[#:tag "tail-recursion"]{Tail Recursion}
Both the @racket[my-length] and @racket[my-map] functions run in 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: imagining how @racket[(my-length (list "a" "b" "c"))] must evaluate:
@racketblock[ @racketblock[