Design and Analysis of Algorithm

123456789
Across
  1. 1. different ways of writing an algorithm is called as?
  2. 3. Another name of the fractional knapsack is?
  3. 5. algorithms are used to find the shortest path from a source node to all other nodes in a weighted graph?
  4. 6. Kruskals algorithm works in the technique of ?
  5. 8. algorithm to find single source shortest path problem with negative edge weights.
  6. 9. sorting by divide and conquer technique by partitioning the array based on pivot element
Down
  1. 1. characteristic of an algorithm to be clear and unambiguous
  2. 2. algorithm to find transitive closure matrix
  3. 4. data structure for storing/ representing Sequence of zero or more elements represented in node
  4. 7. complete binary tree is usually represented in the form of ?