A programming technique where a function calls itself directly or indirectly. Each recursive call works on a smaller portion of the problem until a base case stops further calls. While not common in forex robots (since loops often suffice), recursion might be used for tasks like traversing complex data structures. It’s important to ensure a base case to avoid infinite recursion and stack overflow.

Back to Robots Glossary Index