The Competitve Programmers Handbook

3. It is a data structure that provides two O(1) time operations.
6. This algorithm begins with an empty solution and extends the solution step by step.
8. KAE
10. It is a data structure that maintains a set of elements. The supported operations are
13. It is a technique that combines the complete search and the efficiency of greedy algorithms.
14. it is a data structure that supports two operations: processing a range query and updating an array value.
15. It is a generalized array that consists of key-value-pairs.
16. This type of algorithm takes the best solution at the moment and never goes back.
21. it's the most basic type of data strucure that exists
22. It is a straightforward graph traversal technique. The algorithm begins at a starting node, and proceeds to all other nodes that are
23. It is a dynamic array whose size can be efficiently changed at both ends of the array.
24. it is a fundamental algorithm design problem. It is used to make data structures easier to use.
25. It is an array whose each value is either 0 or 1.

1. It is an array whose size can be changed during the execution of the program.
2. A general method for searching for an element in an array.
4. It is a two-dimensional array that indicates which edges the graph contains.
5. middle This is a technique where the search space is divided into two parts of about equal size.
7. It is the complexity of a program it is written O(times code repeat)
9. It is a greedy like technique that constructs the best possible answer given a "text"
11. It is a data structure that maintains a collection of elements.
12. it is a variable that points to an element in a data structure.
17. It can be used to analyze algorithms that contain operations whose time complexity varies.
18. from the starting node
19. Is a famous sorting method where the elements ”bubble” in the array according to their values.
20. it is a part of the code that you can use over and over again.
26. retrieval and removal.