Across
- 3. This algorithm begins with an empty solution and extends the solution step by step.
- 6. It can be used to analyze algorithms that contain operations whose time complexity varies.
- 9. This type of algorithm takes the best solution at the moment and never goes back.
- 10. middle This is a technique where the search space is divided into two parts of about equal size.
- 12. It is a greedy like technique that constructs the best possible answer given a "text"
- 14. It is a technique that combines the complete search and the efficiency of greedy algorithms.
- 18. It is an array whose size can be changed during the execution of the program.
- 21. It is a data structure that maintains a collection of elements.
- 22. Is a famous sorting method where the elements ”bubble” in the array according to their values.
- 23. from the starting node
- 24. It is a data structure that provides two O(1) time operations.
Down
- 1. It is a two-dimensional array that indicates which edges the graph contains.
- 2. It is a data structure that maintains a set of elements. The supported operations are
- 3. It is an array whose each value is either 0 or 1.
- 4. it is a part of the code that you can use over and over again.
- 5. It is the complexity of a program it is written O(times code repeat)
- 7. it is a data structure that supports two operations: processing a range query and updating an array value.
- 8. retrieval and removal.
- 11. it is a fundamental algorithm design problem. It is used to make data structures easier to use.
- 13. It is a straightforward graph traversal technique. The algorithm begins at a starting node, and proceeds to all other nodes that are
- 15. it's the most basic type of data strucure that exists
- 16. It is a generalized array that consists of key-value-pairs.
- 17. A general method for searching for an element in an array.
- 19. it is a variable that points to an element in a data structure.
- 20. It is a dynamic array whose size can be efficiently changed at both ends of the array.