Across
- 2. best algorithm for finding the greatest common divisor
- 6. the process in which a function calls itself directly or indirectly
- 7. the amount of time the computer needs to run to completion is known as _____________
- 8. notations that are used to compare and rank order of growth
- 9. mixture of natural language and programming language constructs
Down
- 1. relation with an appropriate initial condition set up for recursive algorithm
- 3. most important operation of the algorithm
- 4. sequence of unambiguous instructions for solving a problem
- 5. space complexity of an algorithm is the maximum amount of __________ required by it during execution