human
When you say that an algorithm is ‘recursive’, what does that mean?
assistant
A recursive algorithm is one that calls itself. For example, the Fibonacci sequence is a recursive algorithm. The Fibonacci sequence is defined by the following recurrence relation: F(n) = F(n-1) + F(n-2).