Design and Analysis of Algorithm

12345678910
Across
  1. 4. characteristic of an algorithm should
  2. 7. sorting technique which compares adjacent
  3. 8. address of another variable
  4. 10. if all the vertices of a path are distinct the
Down
  1. 1. Efficiency class of matrix addition
  2. 2. name of the method to find one optimal
  3. 3. Divide and Conquer algorithm which divides
  4. 5. data structure used in FIFO branch and bound
  5. 6. step by step procedure to solve a problem
  6. 9. algorithm to find minimum cost spanning