Book, Data Structures and Their Algorithms 3/10[LS]

“An algorithm is a systematic process for solving a problem.” With this clear and direct sentence, Data Structures and Their Algorithms begins, which reaches its third edition with an expanded, revised text and the addition of two new chapters. The first objective of the pair of authors, however, remains: in a friendly way, to show different data structures, emphasizing their manipulation algorithms and some of their mathematical aspects. Considering that this book is intended not only for undergraduate courses, but also for professionals in the area of ​​software development, the data structures that appear here are among the most used today. The themes of the new chapters introduced are ordering and advanced priority lists. The new chapter on advanced priority lists includes the study of structures such as binomial heaps and Fibonacci heaps, among others. The priority lists described in this new chapter require slightly more advanced mathematical treatment than traditional ones. However, they present very satisfactory results, which is why they were selected for inclusion in the book. Furthermore, knowledge of such structures is relevant in the context of postgraduate courses. Data Structure and Its Algorithms was born from notes from classes taught during more than thirty years of teaching by the authors, and is today considered a reference work in the courses for which it is intended.