Introduction

The work presented to your attention is based on the lectures and seminars of the course "Algorithms and Data Structures for Search", read at the Yandex School of Data Analysis. The full course consists of two semesters, but for now we are publishing the materials of the first of them with the hope that soon we will find the strength to prepare the second part as well. As noted above, the classes consist of lectures and seminars. Various theoretical issues are discussed in the lectures, and techniques for implementing standard algorithms are studied. Seminars are more task oriented.

New sets of practical assignments are periodically given out at the seminars, and the trainees must send their solution within the prescribed time limit. The solution consists of two parts: theoretical substantiation of the chosen method (including complexity estimates) and practical implementation. C ++ code is accepted as the latter.

The implementations sent by the students at the school are checked automatically using a set of pre-prepared tests. To pass the test, you must give the correct answer without exceeding the set limit for resources (time and memory). Taking this process into account, this summary was written. Structurally, it consists of a set of chapters, each of which focuses on a specific section of theory. At the end of each chapter, you will find examples of tasks. For many tasks, we provide the I / O format that is expected from programs, as well as several examples of input and output data. Some of these tasks, however, are more theoretical; therefore, such formats are not given for them.

Sign up now to get the most out of Books2Read

Discover something great at Books2Read.

Thanks for signing up for Books2Read notifications!