Across
- 2. A rule of thumb
- 3. Programming I trade space for time. (7, 11)
- 5. I can only store a fixed number of elements.
- 8. Graph that has no cycles, loops or double edges
- 9. I am not simple
- 10. I take the best option
- 14. Graph where edges only go in one direction
- 17. complexity The time taken by an algorithm to run for a given an input size (4, 9)
- 18. A term used to describe problems not solvable by Turing machines.
- 20. A graph that connects all nodes with the smallest sum of weights
Down
- 1. In what group am I?
- 4. I go back at a dead end
- 6. I follow a First In First Out order
- 7. A function which calls itself
- 11. An algorithm for finding the shortest path between two nodes on a graph
- 12. Force Technique for trying every possibility (5, 5)
- 13. A logical argument that demonstrates that a statement is true or false
- 15. Graph where every node is connected to every other node
- 16. Problems that can be verified in polynomial time
- 19. I am used to notate time complexity