Play With Logic

1234567891011
Across
  1. 4. An algorithm contains a recursive call to itself, its running time can often be described by
  2. 6. sorting algorithms is most efficient to sort string consisting of ASCII characters
  3. 7. The notation we use to describe the asymptotic running time of an algorithm
  4. 8. An algorithm for minimum spanning tree that may generate multiple forest trees
  5. 9. Common key ingredient in Greedy & Dynamic programming
  6. 10. An algorithm has come to mean predicting the resources that the algorithm requires
  7. 11. counting x
Down
  1. 1. the area of study concerned with searching for documents, for information within documents
  2. 2. Algorithms always makes the choice that looks best at the moment
  3. 3. To show correctness of any Algorithm
  4. 5. The number of black nodes (including NIL) on the path from x to a leaf,