The 2nd edition of the book by Robert LaForet is devoted to the description of how a correctly specified sequence of instructions (algorithm) ensures the implementation of various operations with data structures. To clarify this complex topic, the author provides clear text examples. Additionally, it is proposed to launch an online program that clearly demonstrates the principle of operation of data structures. Examples are presented in Java, but knowledge of C ++ or other languages is enough to study the material.
The book begins with an acquaintance of the reader with the theoretical foundations of algorithms and object-oriented programming. Next, arrays, sorts, stacks and queues, recursions, tree structures, hash tables, and other key topics are discussed in an ordered manner (from simple to complex).
The purpose of the tutorial is to help the user choose the correct algorithm for solving a particular problem.