On Wednesday, June 27, 2012, Harry Spier wrote:
> Is the list processing function "last" expensive? Does it traverse > the entire list to get the value? > > Random access in a linked list is costly, so yes. If you need fast random access, vectors and gvectors may be appropriate.
____________________ Racket Users list: http://lists.racket-lang.org/users
