Across
- 1. Visual representation of recursive calls)
- 9. Efficiency, correctness, finiteness)
- 10. Growth rate as input size increases)
- 11. Converting recursive code to iterative)
- 12. Strategies for algorithm development)
- 13. Evaluating algorithm execution speed and resource use)
- 14. Solving recurrences by direct substitution)
- 16. Solving recurrences using loop-based approach)
Down
- 2. Problem-solving technique using self-reference)
- 3. Precise steps to solve a problem)
- 4. Theorem for analyzing divide-and-conquer recurrences)
- 5. Efficient sorting algorithm using heap data structure)
- 6. Shorthand notations for growth trends)
- 7. Mathematical equation describing recursion)
- 8. Natural language or pseudocode)
- 15. Analyzing an algorithm's efficiency)