Across
- 1. it is used to search deeper into the graph
- 3. it is a straight forward sorting method
- 8. process used to visit all the vertices and edges in a graph
- 10. method used to find the pattern
- 11. which case is regardless of the order of input list
- 13. simple search method used to find particular element
- 15. advantage of exhaustive search
Down
- 2. The approach used to solve combinatorial problems
- 4. memory stored in secondary storage
- 5. measures the total memory space required
- 6. step by step procedure to solve a problem
- 7. is a way to express the long term growth of a function
- 9. application of brute force method
- 12. last method to improve the efficiency of sequential sear
- 14. it is an upper bound on function (notations)
- 16. disadvantage of exhaustive search