Bille P. Solutions for Introduction to Algorithms Second Edition by Cormen T.H., Leiserson C.E., Rivest R.L., Stein C

Springer, 2010. — 978 p. This is a book for the computationalist, whether a working programmer or anyone interested in methods of computation. The focus is on material that does not usually appear in textbooks on algorithms. Where necessary the underlying ideas are explained and the algorithms are given formally. It is assumed that the reader is able to understand the given...

3rd edition. — The MIT Press, 2009. — 1312 p. — ISBN-13 978-0262033848. Solutions for a select set of exercises and problems for Introduction to Algorithms, Third Edition . Selected Solutions for Chapter 2: Getting Started Selected Solutions for Chapter 3: Growth of Functions Selected Solutions for Chapter 4: Divide-and-Conquer Selected Solutions for Chapter 5: Probabilistic...

2 edition — McGraw-Hill, 2001. — 1056 p. — ISBN 10-9780070131514, 13-978-0070131514 This book is one of a series of texts written by faculty of the Electrical Engineering and Computer Science Department at the Massachusetts Institute of Technology. It was edited and produced by The MIT Press under a joint production-distribution agreement with the McGraw-Hill Book Company. This...

O’Reilly, 2017. — 590 p. — ISBN 978-1-449-37332-0. Data is at the center of many challenges in system design today. Difficult issues need to be figured out, such as scalability, consistency, reliability, efficiency, and maintainability. In addition, we have an overwhelming variety of tools, including NoSQL datastores, stream or batch processors, and message brokers. What are...

4th Edition. — Addison-Wesley, 2011. — 969 p. — ISBN: 032157351X. Essential Information about Algorithms and Data Structures A Classic Reference The latest version of Sedgewick’s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades. Broad Coverage Full treatment of data structures and algorithms for sorting, searching, graph...