Do programmers need to learn algorithms at all? This question has been debated as much as whether Java is the best language, VIM or Emacs is the best editor, and whether programmers need to learn math. To avoid getting bogged down in this debate, let’s take a translation of the word “algorithm.” What is an algorithm?
Let’s look at the standard definition: an algorithm is a set of instructions that can obtain a desired output in a finite amount of time for a specified input. This definition is too abstract, but let’s just say that an algorithm is actually an idea and a way to solve a problem. So at this point, would you still say that the algorithm doesn’t matter?
This book starts from a series of interesting life examples, comprehensively introduces the basic method of constructing algorithm and its wide application, vividly shows the interestingness and practicability of algorithm.
The book is divided into two parts. The first part introduces the concept of algorithm, common algorithm structure and implementation methods.
The second part introduces the application of the algorithm in various fields, such as physical experiment, computer graphics, digital audio processing and so on. Among them, there are a variety of well-known algorithms, such as neural networks, genetic algorithms, discrete Fourier transform algorithm and various interpolation algorithms, but also the humble sorting and probability calculation algorithm. The explanation is easy to understand without losing depth and rigor, which is of great inspiration to programmers. All the examples in the book are relevant to life, showing the essence of algorithm solving problems incisively and vividly, making you love algorithms and enjoy them.
This book is suitable for software developers, programming and algorithm enthusiasts, and computer science students.
Due to the space limit xiaobian, xiaobian only here to show you the catalog and part of the content, there is a need for complete documentation of the program ape (yuan) can help forward + pay attention to the end of the public number to obtain
Chapter 1 programmers and algorithms
Chapter 2 is the basis of algorithm design
Chapter 3 common ideas of algorithm design
Chapter 4 Arabic numerals and Chinese numerals
Chapter 5 three buckets divided equally into 8 liters of water
Chapter 6 The devil and the Monk crossing the river
Chapter 7 Stable matching and partner problem
Chapter 8 Einstein’s thoughts
Chapter 9 project management and topological ordering of graphs
Chapter 10 RLE compression algorithm and PCX image file format
Chapter 11 algorithms and calendars
Due to the space limitation, the detailed information of the PDF document is too comprehensive, the details are too much, so only part of the knowledge point screenshots out of the rough introduction, each small node there are more detailed content! Not only outline and directory, there is a need for the program ape (yuan) can help forward + pay attention to the end of the public account to obtain
Chapter 12. Experimental data and curve fitting
Chapter 13 nonlinear equations and Newton iterative method
Chapter 14 computational geometry and computer graphics
Chapter 15 audio spectrum and equalizer and Fourier transform algorithm
Chapter 16 global Optimal Solution and Genetic algorithm
Chapter 17 calculator program and large integer calculation
Chapter 18 RSA algorithm – Encryption and signature
Chapter 19: Sudoku
Chapter 20 Huarong Road Game
Chapter 21 A* Path Finding algorithm
Chapter 22 Tetris
Chapter 23 game tree and board games
Appendix A Common techniques for algorithm design
Appendix B a board game design framework
To pick up page 423 of the article, The Joy of Algorithms, just:
— The article will be forwarded + comments, follow the public account below to obtain.
