Algorithms Crossword — Questions & Answers
Across
- 1. : Approach that makes locally optimal choices at each step.
- 4. : Tree-based priority queue data structure.
- 5. TABLE : Stores key–value pairs for near O(1) lookup.
- 6. : Level-order graph traversal using a queue.
- 8. : General term for time/space cost of an algorithm.
- 10. : FIFO data structure.
- 12. : Step-by-step procedure to solve a problem.
- 14. SORT : Linear ordering of a DAG’s vertices.
- 16. AND CONQUER : Break, solve subproblems, and combine.
- 17. PROGRAMMING : Optimizes by storing results of overlapping subproblems.
- 18. : Acyclic connected graph.
- 20. : Shortest path algorithm for non-negative weights.
- 22. : Technique where a function calls itself.
Down
- 1. : Vertices and edges model relationships.
- 2. : Stable divide-and-conquer sorting algorithm.
- 3. : Plain-language outline of an algorithm.
- 7. : Systematically explores and undoes choices.
- 9. : Divide-and-conquer sort using a pivot.
- 11. SEARCH : Search a sorted list by repeatedly halving the range.
- 13. : Diagram using symbols to visualize algorithm flow.
- 15. : Repeated execution using loops.
- 16. : Depth-first graph traversal using a stack/recursion.
- 19. O : Notation for upper bound on growth rate.
- 21. : LIFO data structure used by function calls.