Design and Analysis of Algorithm

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