The point of the book is to enable the reader to better understand Computer Science and apply knowledge in practice, and not at all to completely replace four years of study.

In particular, this is not a book with proofs . Indeed, the second volume of the book discusses proof methods, but standard algorithms are usually presented here without proof. The idea is for the reader to become aware of the existence of these algorithms and learn how to use them without going into details. For a proof book written for undergraduate and graduate students, I highly recommend Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein (the authors are usually grouped under abbreviated CLRS).

This is not a book on programming: you will not find here recommendations on when to use ints and when to use doubles, or explanations of what a loop is. The reader is expected to be able to understand the pseudocode listings used to describe the algorithms (all programs in this book are written in C-based pseudocode). The purpose of the book is to connect the concepts of Computer Science with programming methods already familiar to the reader.