If you ask a carpenter: what kind of tool you need to work, he may answer you: "I just have a hammer and a saw." But if you ask an old woodworking or a master's architect, he will tell you "I need some precise tools." Since the problems solved by the computer are abstracting problems in life, their complexity is self-evident, so we need this precise and effective tool to solve complex problems in real life. Algorithms, data structures are an indispensable precise tool in programming. The importance of algorithms is that every programmer is very clear.
Solving considerable part of the problem in programming is involved in a wide variety of scientific calculations, what is the foundation of the programmer? The actual problem is converted to the program. After a process of abstract problems, a perfect mathematical model is established. Only in this way, we can build a good design. We are not difficult to see the importance of computational mathematics in the field of programming. Mr. Mengyan once wrote a number of technical books, five times, and seems that this has become one of the signs of Mr., this adventure is also one ...
As this paper, if you don't introduce the following, this kind of fear of the joke is the epic TAOCP of computer programming:
Computer programming art
English Name: The Art of Computer Programming
Author: Donald.E.Knuth
Donald.e.knuth Life The most brilliant moment of Stanford University, the Winner of the American Computer Association Tulifting Award is a well-deserved Thai fighting in the field. This masterpiece that is referred to as TAOCP is profound and covers almost the most important content of computer program settlement and theory. Only three volumes issued now, based on basic algorithm, half-value algorithms, and sorting and search. There should be a total of 7 volumes. In addition to reading this book, I can read this book like other books, or it can be designed as a computer program. After all, the content covers it too wide. The most concerned about the book is the strict thinking method. Everyone has its own reading method, some masters should read books in order, because it is written simply like poems, but this still looks at all experience. As for the value of this book, I think Bill Gates is enough to explain the problem: "If you think you are a real outstanding programmer reading Knuth" computer programming art ", if you can read the whole book, please give me Send a resume. " The work of the author's mathematics is the rigorous style of this book. Although this book is not described in today's popular programming language, this does not damage its "program design epic" status. The reason is very simple, and its connotation design ideas will never have time. Unless otherwise hard, it is recommended that readers choose English.
If TAOCP is metaphor as "Homer's Homer's Epic" in computer program design theory, "the algorithm introduction" is referred to as CLRS may wish to call it "Computer Algorithm Bible."
"Algorithm introduction"
English Name: Introduction To Algorithms
Author: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
The main author of this book is from Massachusetts University of Technology, one Ronald L.Rivest, who has obtained the Tu Waraz in the public secret key password algorithm RSA, is currently a standard textbook for algorithm, many of the American computer system. It uses it, and some of the domestic institutions will also use this book as a teaching material for algorithm courses. In addition, many professionals often quote it. Since TAOCP only publishes 3 volumes, CLRs compares the former, which is more comprehensive, and basically includes all classic algorithms. All book programs are implemented by pseudo code, which adds the versatility of this book, making programmers using various programming languages as a reference. The language is popular, it is very suitable for the use of algorithm teaching materials and self-study algorithms. Many domestic works are named data structures, from this book interrupted, mixing the data structure and algorithm to talk, to make the author are fascinating. This is also the reason I don't very willing to recommend domestic works. You will find that all data structures and algorithm books will now use this book as one of the references, more of the questions, this book is the best choice for the reader's algorithm. As the supplement of this book, I am willing to recommend the following learning information to you: You can find all the exercises of this book through this address: http://www.itu.dk/people/beetle/. In order to better learn the content in this book, the best guidance is of course from the author itself telling the book, readers can pass
Http://18.89.1.101/sma/5503fall2001/index5503fall2001.html Gets a recording of the course.
There are two sets of excellent books. I don't want to be a separate recommendation, but the advanced language programmers as beginner algorithms are also excellent for excellent reference:
Algorithms In C and Algorithms in Java Series. The authors are a famous professor, the Princeton University Computer, Robert Sedgewick, which is the gori of TAOCP author Donald.e.knuth. Algorithm theory is not inferior to CLRS, and two versions are tailored to C and Java programmers. As a reference for the specific language, this two is also my only is willing to recommend it to you. Can be supplemented as a book "algorithm" book. If you are interested in cryptographic algorithms, then "Application Cryptography" is your first choice.
Books recommended by computer mathematical theory are quite a few, which is what mathematics theory is what we should be involved. What are the basic we are not needed, you can refer to "9CBS development masters" September issue "computer science and technology mathematics Theory Talks ", or browse this article through the following address:
http://www.cstc.net.cn/docs/docs.php?id=111
The position of discrete mathematics in the field of computer mathematics theory is clearly the first, first recommend it to everyone:
Discrete mathematics and its application
English Name: Discrete Mathematics and ITS Applications, Fourth Edition
Author: Kenneth H.Rosen
The value of this book has been confirmed by hundreds of universities around the world. As a classic textbook in the field of discrete mathematics, almost all well-known colleges around the world have used this book as a textbook. In my personal opinion, this book can be called discrete mathematics. The books not only introduce the theory and methods of discrete mathematics, but also rich historical materials and related learning website resources. More exciting is that this book is less likely to combine discrete mathematics theory and application. You can see discrete mathematics theories in many fields such as logic circuits, program design, business, and Internet. Taking into account the foundation of most readers, it is recommended to give you the Chinese version of this book (the fourth edition of the original book). The English version of this book has added a lot of mathematics and computer scientists. It is a reference material for computer scientific history. As a textbook, this book is equipped with a considerable number of exercises. There is also a group of questions in each chapter, and the student has learned the calculation and discrete mathematics content to train. This book is also the only English textbook that I personally read when I study discrete mathematics, which is a good book worth recommending. The object of traditional mathematical research is too abstract, causing not enough attention to specific problems. In order to directly facilitate application, great computer scientists and mathematician Donald.e.knuth proposed "specific mathematics" in MIT. Since then, "Specific Mathematics" has become the foundation of computer science. So, the following is recommended is a diverse work:
"Specific mathematics - computer science foundation"
English Name: Concrete Mathematics A Foundation for Computer Science (Second Edition)
Very exciting is that the main author of this book is Thai Donald.e.knuth and his colleague Ronald L.graham. The manuscript is a textbook that they organize the graduate student of the computer department in 1970. The content is the extension of the first minor TAOCP in Knuth, and some are much more innecting to TAOCP. The focus is placed in advanced computer programming topics and algorithm analysis, involving almost all might of mathematical knowledge in the field of computer science. Specific mathematics is the synthesis of discrete mathematics and continuous mathematics. This is extremely excellent in books. The contents of the introduction involves many classic problems in the book more easy to understand than currently spread. There is a great help to improve your calculation mathematics cultivation. Sometimes readers don't understand because of the calculation mathematics foundation is not very solid, but with my personal experience, if there is a better understanding of this book, I will give you a happy life like TAOCP. Bring great convenience.
In general, the algorithm mathematics is the foundation of the programming, the essence of scientific science, is still needed to pay sufficient attention. The role and status of algorithms and mathematics in computer programming may wish to refer to my "Computational Scientific Mathematics Theory Talk", which has more detailed discussion.
