“The perfect algorithm. Tim Rafgarden's "Fundamentals" is a cool book if you ignore the translation.
The author is very simple about algorithms. But it's funny that in the process of reading Peter's editorial errors, I had to look into the old classic book of Cormen, Leiserson and Rivest, "Algorithms: Construction and Analysis," which without it is much more difficult to understand. It's just that Tim Rafgarden hides details that are important, but not relevant to the essence of the algorithms themselves, and without which you can capture the basic logic.
Tim's. 4 books in this series, but the book "Fundamentals" is the starting book and it contains the following chapters:
- Introduction: Why do we need algorithms, when the implementation of basic algorithms is often in almost all languages
- Asymptotic notations - a little about mathematical notations that are needed to think about the effectiveness of algorithms
- Divide and Conquer Algorithms are about algorithms that solve a problem recursively by calling themselves to the parts of the original problem.
- The basic method is a method for simply determining the asymptotic complexity of divide-and-conquer algorithms.
- QuickSort algorithm - about a very beautiful sorting algorithm with interesting proof n
- Linear selection - about the choice of i-th ordinal statistics for linear time from an unsorted array
- Applications on Induction Evidence and Discrete Probabilities
This is a good book, but read in the original:)
#ComputerScience #Software