Across
- 5. : A graph with few edges relative to the number of its vertices.
- 6. : sequence of unambiguous instructions for solving a problem.
- 7. : Most important operation of the algorithm.
- 9. : Smallest convex set containing S points.
- 10. : Best algorithm for finding the greatest common divisor.
Down
- 1. : Worst case complexity is log2n.
- 2. : Mixture of natural language and programming language constructs.
- 3. : Complexity is order of mn.
- 4. : Notations that are used to compare and rank order of growth.
- 8. : Relation with an appropriate initial condition set up for recursive algorithms.