Across
- 4. ____________ refers to computing the running time of any operation in mathematical units of computation
- 6. a generic way of describing an algorithm without using any specific programming language related notations
- 9. an approach that finds all the possible solutions to find a satisfactory solution to a given problem.
- 10. Which method use induction to find the constants and show that the solution works.
- 11. relation with an appropriate initial condition set up for recursive algorithm
- 14. A finite set of instructions or logic, written in order, to accomplish a certain predefined task is called_______
- 15. ____________ notation is used to represent the lower bounds of algorithms.
- 16. Functions calls itself
Down
- 1. Lower bound running time complexity of an algorithm is also called as.................
- 2. is the amount of computer memory required to the execute the program /problem.
- 3. ____________ measures the worst case time complexity or longest amount of time an algorithm can take to complete.
- 5. notations that are used to compare and rank order of growth
- 7. The ____________ complexity of the algorithm is the function defined by the maximum number of steps taken on any instance of size n.
- 8. most important operation of the algorithm
- 12. _____________ is used for solving recurrence relations of the form: T(n) = aT(n/b) + f(n)
- 13. The performance of an algorithm is measured on the basis of _________ Complexity.