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