University
of Washington • CSE583 • D. Notkin © 2000
39
Partial conversions
lQuicksort is a good example of a program for which there is no direct and simple conversion to tail recursion
lThe second recursive
call can be made tail recursive, but not
the first
lQuicksort can be
implemented using iteration, but only by
implementing a stack internally