Question

I am trying to write two separate tail recursive functions that compute the length of a list and I am given these limitations:

1. write a version, lengtht that is tail recursive and uses external (non-nested) auxiliary functions as needed

2. write a second version, lengtht2 that uses no additional top-level functions. The function should still be tail-recursive, and can use any local bindings that you want

I am new to racket and this is what I understand the general form of tail recursion is:

(define (func x)
    (cond (end-test-1 end-value-1)
          (end-test-2 end-value-2)
          (else (func reduced-x))))

I am just a little confused about how to do this

Answer 1

This looks like homework, so I’ll give you some hints to point you in the right direction, and you can fill-in the blanks. Try this for the first question:

(define (loop lst acc)              ; receives a list and an accumulator
  (cond ((null? lst) <???>)         ; if the list is empty return the accumulator
        (else (loop <???> <???>)))) ; advance the recursion, +1 to accumulator

(define (length1 lst)
  (loop <???> <???>))               ; how should we initialize the iteration?

Try this for the second question:

(define (length2 lst)
  (letrec ((loop <???>)) ; lambda with the same procedure as the previous `loop`
    (loop <???> <???>))) ; start the recursion exactly the same as in `length1`

In any case, think for a moment: what’s the length of an empty (null) list? the answer will show you how to initialize the iteration. And for both solutions, we use an extra parameter called acc for keeping track of the answer so far, and we pass it along with the list to a looping tail-recursive procedure.