[Interactive publishing network] Introduction to algorithms: 3rd version of the original book. Now, you can get 8 yuan cash coupons for special activities.

[Interactive publishing network] "Introduction to algorithms: 3rd version of the original book" is now available to receive 8 yuan cash coupons after purchase.

 There are some rigorous but not comprehensive descriptions in the relevant algorithms; others involve a large number of subjects, but lack rigor. This book integrates rigor and comprehensiveness, discusses various algorithms in depth, and strives to make the design and analysis of these algorithms acceptable to readers at all levels. The chapters in this book are self-contained and can be used as independent learning units. algorithms are described in English and pseudocode, and people with preliminary programming experience can understand them. instructions and explanations strive to be easy to understand, without losing its depth and rigor in mathematics. The introduction to algorithms (3rd edition of the original book) selects classic materials, rich content, reasonable structure, and clear logic. It is a very practical teaching material for undergraduate data structure courses and graduate algorithm courses, in the career of IT professionals, this book is also a reference book or Engineering Practice Manual necessary for the case. Major changes in version 3rd: added the van emde boas tree and multi-threaded algorithm, and moved the matrix base to the appendix. This chapter revised the recursive formula (now called the "divide and conquer policy") to cover the divide and conquer law more extensively. Remove the two chapters that are rarely taught: Two heap and sorting network. The Dynamic Programming and greedy algorithm contents were revised. Stream network-related materials are now based on all the streams on the edge. As materials about the Matrix basics and the strassen algorithm are moved to other chapters, the content of the chapter matrix operations takes less space. Modified the discussion on the knuth-Morris-Pratt string matching algorithm. 100 exercises and 28 questions were added, and references were also updated.

For more information about the activity, see the activity page.

Link: http://www.china-pub.com/STATIC07/1212/sf/1.asp