Design of Analysis Algorithm

123456789101112
Across
  1. 4. is a procedure for solving a problem
  2. 8. sorting technique with worst case time complexity O(n2)
  3. 9. Which knapsack problem, is solved most efficiently using greedy approach
  4. 10. graph problem solved by using dynamic programming
  5. 12. approach to solve activity selection problem
Down
  1. 1. dynamic programming uses principle of
  2. 2. bit is reserved as a parity bit in an ASCII set
  3. 3. is used for solving the N Queens Problem
  4. 5. Best feasible solution
  5. 6. Search technique needs sorted input list
  6. 7. invented all pair shortest path
  7. 11. Which is external sorting algorithm