Evgeny_CD, Архитектор (09.12.2007 22:13, просмотров: 512)Бука Algorithms in C Swdgewick ->. Нестареющая классика! http://upload.caxapa.ru/books/algorithms-in-c-sedgewick.pdf
Algorithms in C 9780201514254 (0201514257), Addison Wesley, 1990 Algorithms in C is a comprehensive repository of algorithms, complete with code. If you're in a pinch and need to code something up fast, this book is the place to look. Starting with basic data structures, Algorithms in C covers an enormous scope of information, with extensive treatment of searching and advanced data structures, sorting, string processing, computational geometry, graph problems, and mathematical algorithms. Although the manual often neglects to provide rigorous analysis, the text surrounding the algorithms provides clear and relevant insight into why the algorithms work. This book is intended to survey the most important computeralgorithms in use today and to teach fundamental techniques tothe growing number of people in need of knowing them. It can beused as a textbook for a second, third, for fourth course incomputer science, after students have acquired some programmingskills and familiarity with computer systems, but before theyhave taken specialized courses in advanced areas of computerscience or computer applications. Additionally, the book may beuseful for self-study or as a reference for those engaged in thedevelopment of computer systems or applications programs, sinceit contains a number of implementations of useful algorithms anddetailed information on their performance characteristics. Thebroad perspective taken in the book makes it an appropriateintroduction to the field. The book contains 45 chapters grouped into 8 major parts: fundamentals, sorting, searching, string processing, geometricalgorithms, graph algorithms, mathematical algorithms andadvanced topics. A major goal in developing this book has beento bring together the fundamental methods from these diverseareas, in order to provide access to the best methods known forsolving problems by computer. Some of the chapters giveintroductory treatments of advanced material. It is hoped thatthe descriptions here can give readers some understanding of thebasic properties of fundamental algorithms ranging from priorityqueues and hashing to simplex and the fast Fourier transform.
Algorithms in C 9780201514254 (0201514257), Addison Wesley, 1990 Algorithms in C is a comprehensive repository of algorithms, complete with code. If you're in a pinch and need to code something up fast, this book is the place to look. Starting with basic data structures, Algorithms in C covers an enormous scope of information, with extensive treatment of searching and advanced data structures, sorting, string processing, computational geometry, graph problems, and mathematical algorithms. Although the manual often neglects to provide rigorous analysis, the text surrounding the algorithms provides clear and relevant insight into why the algorithms work. This book is intended to survey the most important computeralgorithms in use today and to teach fundamental techniques tothe growing number of people in need of knowing them. It can beused as a textbook for a second, third, for fourth course incomputer science, after students have acquired some programmingskills and familiarity with computer systems, but before theyhave taken specialized courses in advanced areas of computerscience or computer applications. Additionally, the book may beuseful for self-study or as a reference for those engaged in thedevelopment of computer systems or applications programs, sinceit contains a number of implementations of useful algorithms anddetailed information on their performance characteristics. Thebroad perspective taken in the book makes it an appropriateintroduction to the field. The book contains 45 chapters grouped into 8 major parts: fundamentals, sorting, searching, string processing, geometricalgorithms, graph algorithms, mathematical algorithms andadvanced topics. A major goal in developing this book has beento bring together the fundamental methods from these diverseareas, in order to provide access to the best methods known forsolving problems by computer. Some of the chapters giveintroductory treatments of advanced material. It is hoped thatthe descriptions here can give readers some understanding of thebasic properties of fundamental algorithms ranging from priorityqueues and hashing to simplex and the fast Fourier transform.