Data structures and algorithms

This book describes the 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 have expanded its content to include material on external storage algorithms and memory management. Like the previous one, this book can form the basis of a training course on data structures and algorithms. We do not require special training from the reader, we only assume his familiarity with any high-level programming languages, such as Pascal. We tried to highlight data structures and algorithms in the broader context of solving problems using computer technology, and also used abstract data types to informally describe and implement algorithms. And although abstract data types are just beginning to be used in modern programming languages today, the authors believe that they are a useful tool for developing programs regardless of the programming language used. We also constantly emphasize and implement the idea of calculating and estimating the execution time of algorithms (the time complexity of algorithms) as an integral part of the process of computer problem solving. This reflects our hope that programmers realize that when solving problems of progressively larger sizes, the time complexity of the chosen algorithm is of particular importance, and not the capabilities of new generations of computing tools.