Your examples are not tail recursive because an extra step is needed before returning from the function call and that step cannot be thrown away!
Alexander Schmolck <[EMAIL PROTECTED]> wrote: >def even(n): > return n == 0 or not odd(n-1) > >def odd(n): > return n == 1 or not even(n-1) > -- Regards, Casey -- http://mail.python.org/mailman/listinfo/python-list
