Data structures and algorithms

This book describes data structures and algorithms that are the foundation of modern computer programming. The basis of this book is the first six chapters of our previously published book The Design and Analysis of Computer Algorithms. We expanded its content by including material on external storage algorithms and memory management. Like the previous one, this book can form the basis of the training course on data and algorithms. We do not require special training from the reader, we only assume his acquaintance with any high-level programming languages, such as Pascal.
We tried to illuminate data structures and algorithms in a wider context of solving problems using computer technology, and also used abstract data types for informal description and implementation of algorithms. And although today abstract data types are just beginning to be used in modern programming languages, the authors believe that they are a useful tool for developing programs, regardless of the programming language.
We also constantly emphasize and introduce the idea of ​​calculating and evaluating the time of algorithms (temporary complexity of algorithms) as a component of the computer solution of problems. This reflects our hope that programmers realize that when solving problems, the temporary complexity of the selected algorithm, and not the possibility of new generations of computing agents, is of particular importance