Analysis of Algorithm

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