recursion in computer science
Recursion in computer science refers to a programming technique where a function calls itself to solve a problem by breaking it into smaller subproblems. It involves solving the base case first and then repeatedly applying the same logic to solve the remaining subproblems until the original problem is solved.
Requires login.
Related Concepts (1)
Similar Concepts
- infinite recursion
- recursion depth
- recursion in graph theory
- recursion in mathematical functions
- recursion theory
- recursive algorithm
- recursive algorithms
- recursive data structures
- recursive function
- recursive function calls
- recursive functions
- recursive functions in programming
- recursive method
- recursive programming
- tree recursion