Recursive Algorithms
- Created by: samuelpitman
- Created on: 29-11-16 13:08
View mindmap
- Recursive Algorithms
- A subroutine is recursive if it is defined in terms of itself. The process of executing the subroutine is called recursion
- Recursive Routine has three essential characteristics
- A stopping condition to base case must be included which when met means that the routine will not call itself and will start to 'unwind'.
- For input values other than the stopping condition, the routine must call itself
- The stopping condition must be reached after a finite number of calls.
- Tree Traversal Algorithms
- In-order Traversal Algorithm
- Post-Order Traversal Algorithm
Comments
No comments have yet been made