Summary
Recursion is a programming technique in which a function calls itself. This may seem strange at first, but it can be a very powerful way to solve problems. One way to think about recursion is as a divide-and-conquer approach. To solve a problem recursively, we first divide it into smaller subproblems. Then, we call the recursive function on each of the subproblems. The recursive function will then solve the subproblems and return the results. Finally, we combine the results from the subproblems to solve the original problem.
Written for
- Institution
- JNTUK UNIVERSITY
- Course
- DATA STRUCTURES AND ALGORITHMS (RC16012)
Document information
- Uploaded on
- October 23, 2023
- Number of pages
- 51
- Written in
- 2023/2024
- Type
- SUMMARY
Subjects
-
data
-
data and structures
-
computer
-
science
-
structure
-
recursion
-
lists
-
queues