[plt-scheme] List loop timing

Carl Eastlund wrote:

> What non-tail-recursive version of reverse are you comparing here?  It
> can be written non-tail-recursively and still have the same asymptotic
> complexity, and quite possibly the same or similar running time.

I'm thinking of naive structural recursion. This is one of the examples 
I use to motivate tail recursion in first term (details of stack and 
heap optimization are deferred to second term), though I am careful to 
make Matthias's point that one does not always save time this way. --PR