The algorithm of Sedgewick is the same as the taocp of Gartner.

Introduction

In the computer field, algorithms are an eternal topic. Even if you just put out all the books on algorithm entry, the Chinese and foreign books can even fill the entire Tiananmen Square. But there are still a few of them that are so different. This book is one of them.

This book is a programmer's friend. After many years of work, are the concepts familiar to you, such as quickrank, hackman coding, and KMP, fading into non-connotation nouns in your mind?

This book is a mentor to students. During the translation process, I lamented for countless times: "How nice would it be if I could have this book !" It should be said that this book is tailored to students studying at school.

This book is the enemy of teachers. If the teachers still have to follow the instructions and only stay at the algorithm stage in the 1234 s, they will be greatly behind this era.

Enter this book

Algorithm (version 4th)

• The masterpiece of Sedgewick, in the same line as the taocp of Gartner
• The best-selling book that has been revised for decades
• Covers 50 algorithms that all programmers must master

Author profile:

Robert SedgewickDr. Stanford, with the mentor Donald E. knuth, who has been a professor of computer science at Princeton University since 1985 and former head of the department. He is also a member of the board of Adobe Systems, and has worked at Xerox PARC and the Institute of Defense Analysis (Defense Analyses) and the French National Institute of Information and automation (INRIA) for research work. His research interests include analysis and combination, analysis and design of data structures and algorithms, and program visualization.

Kevin WayneDr. Cornell, Senior Lecturer in the Computer Science Department of Princeton University, has studied algorithm design, analysis, and implementation, especially graph and discrete optimization.

Features:

• The latest version of the best-selling book Sedgewick, a classic reference book in the algorithm field, reflects the core knowledge system of algorithms that have evolved over decades.
• The content comprehensively describes the algorithms and data structures for sorting, searching, graph processing, and string processing, covering 50 algorithms that each programmer should know.
• The newly revised Code brand-new JAVA Implementation Code adopts a modular programming style, and all the code can be used by readers.
• Combined with practical applications, this paper explores algorithms in important scientific, engineering, and commercial application environments, and provides the actual code of algorithms, rather than the pseudocode commonly used in similar works.
• Intelligent, interesting, concise, and concise content. Examples are displayed with rich visual elements, well-designed code, detailed historical and scientific background knowledge, and various difficult exercises, all of this will make readers easy to understand.
• Scientific Methods Use appropriate mathematical models to accurately discuss algorithm performance. These models are verified in real environments.
• The website algs4.cs.princeton.edu, which is integrated with the Internet, provides a summary of the content of this book and related resources such as code, test data, programming exercises, and teaching courseware.

Related reading:

• Amazon book reviews-Algorithms(Note: The book reviews fully summarize the differences between this book and introduction to algorithms)

Additional reading:Computer Programming art, Volume 4A: Composite algorithms (1) (English version) Introduction:

Computer Programming Art series is recognizedAuthoritative Work in the field of computer scienceThe program design theory has a profound impact on the development of the computer field. This book is suitable for those who work in computer science, computational mathematics, and other fields. It is also suitable for teachers and students of relevant majors in colleges and universities as reference books for teaching. for readers who want to have a deep understanding of computer algorithms, is an essential treasure. Volume A is a "combination algorithm", and volume 4th itself contains several volumes. Composite search is a rich and important topic. knuth has a lot of content to write. This book includes about 1500 exercises and their answers, and fact arguments that are not found in hundreds of other publications.

Volume 1

Vol. 2

Volume 3

Interview with Gartner:

• [Turing interview: Donald E. knuth (Chinese Version of Gartner)
• Knuth on the art of computer programming (I)
• Knuth on the art of computer programming (II)

Reading:

• Understanding of strict mathematical definitions of algorithms using set theory in taocp