O’Reilly Media, 2015. — 435 p. — ISBN13: 063-6-920-03288-5. Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. This updated edition of Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right algorithm...
Second edition. — O’Reilly, 2016. — 389 p. — ISBN: 978-1-4919-4892-7. Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. This updated edition of Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right...
Wiley, 1984. — 239 p. This book provides an introduction to the analysis of particular algorithms. It has its origin in lecture courses given at the Universitat des Saarlandes, Saarbrucken in 1980 and attheJohann Wolfgang Goethe-Universitat Frankfurta.M. in 1982. The material can be covered in a one-semester course. In preparing the notes for publication as a book, I have added...
New York: Leanpub, 2018. — 131 p. This book powers our popular Data Structures and Algorithms online specialization on Coursera and the online MicroMasters program on edX. Since the launch of our online courses in 2016, hundreds of thousands students tried to solve many programming challenges and algorithmic puzzles described in this book. We invite you to join them! Problem...
New York: Manning Publications, 2021. — 769 p. Advanced Algorithms and Data Structures introduces a collection of algorithms for complex programming challenges in data analysis, machine learning, and graph computing. As a software engineer, you’ll encounter countless programming challenges that initially seem confusing, difficult, or even impossible. Don’t despair! Many of...
Nielsen, 2019. — 72 p. This book is designed to help those learning and teaching Computer Science. The aim of the book is to help students build fluency in their Python programming. The book would suit students who have already been introduced to the three basic programming constructs of structured programming, namely sequence, selection and iteration. The learning curve for...
New York: Springer-Verlag, 1992. — 360 p. A text for a graduate course in mathematics, for students with at least some basic knowledge of set theory, rational integers, combinatorics (Newton is sufficient), and elementary analysis and algebra.
Cambridge University Press, 1995. — 489 p. This book presents the basic concepts in the design and analysis of randomized algorithms at a level accessible to advanced undergraduates and to graduate students. We expect it will also prove to be a reference to professionals wishing to implement such algorithms and to researchers seeking to establish new results in the area. We...
Soundlikeyourself Publishing, LLC, 2019. — 229 p. — ISBN: 978-0-9992829-4-6. Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes hints or solutions to all quizzes and problems, and a series of YouTube videos by the author accompanies the book. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman...
Cognella, 2020. — 179 p. — ISBN13: 978-1516535064. Algorithms in Action effectively introduces students to a variety of techniques for designing algorithms with a focus on developing intuitive understanding. Readers learn how to successfully construct foundational algorithms, preparing them for more advanced courses in the discipline, as well as professional application. Over...
2nd edition. — Wiley, 2019. — 800 p. — ISBN: 978-1-119-57596-2. A friendly introduction to the most useful algorithms written in simple, intuitive English The revised and updated second edition of Essential Algorithms, offers an accessible introduction to computer algorithms. The book contains a description of important classical algorithms and explains when each is...
Comments