000 06257nam a22005895i 4500
001 978-3-030-54256-6
003 DE-He213
005 20221102211557.0
007 cr nn 008mamaa
008 201005s2020 sz | s |||| 0|eng d
020 _a9783030542566
_9978-3-030-54256-6
024 7 _a10.1007/978-3-030-54256-6
_2doi
050 4 _aQA76.6-76.66
072 7 _aUM
_2bicssc
072 7 _aCOM051000
_2bisacsh
072 7 _aUM
_2thema
082 0 4 _a005.11
_223
100 1 _aSkiena, Steven S.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_966681
245 1 4 _aThe Algorithm Design Manual
_h[electronic resource] /
_cby Steven S. Skiena.
250 _a3rd ed. 2020.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2020.
300 _aXVII, 793 p. 1 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTexts in Computer Science,
_x1868-095X
505 0 _aTO UPDATE Practical Algorithm Design -- to Algorithm Design -- Algorithm Analysis -- Data Structures -- Sorting and Searching -- Graph Traversal -- Weighted Graph Algorithms -- Combinatorial Search and Heuristic Methods -- Dynamic Programming -- Intractable Problems and Approximation Algorithms -- How to Design Algorithms -- The Hitchhiker’s Guide to Algorithms -- A Catalog of Algorithmic Problems -- Data Structures -- Numerical Problems -- Combinatorial Problems -- Graph Problems: Polynomial-Time -- Graph Problems: Hard Problems -- Computational Geometry -- Set and String Problems -- Algorithmic Resources.
520 _a"My absolute favorite for this kind of interview preparation is Steven Skiena’s The Algorithm Design Manual. More than any other book it helped me understand just how astonishingly commonplace … graph problems are -- they should be part of every working programmer’s toolkit. The book also covers basic data structures and sorting algorithms, which is a nice bonus. … every 1 – pager has a simple picture, making it easy to remember." (Steve Yegge, Get that Job at Google) "Steven Skiena’s Algorithm Design Manual retains its title as the best and most comprehensive practical algorithm guide to help identify and solve problems. … Every programmer should read this book, and anyone working in the field should keep it close to hand. … This is the best investment … a programmer or aspiring programmer can make." (Harold Thimbleby, Times Higher Education) "It is wonderful to open to a random spot and discover an interesting algorithm. This is the only textbook I felt compelled to bring with me out of my student days.... The color really adds a lot of energy to the new edition of the book!" (Cory Bart, University of Delaware) --- This newly expanded and updated third edition of the best-selling classic continues to take the "mystery" out of designing algorithms, and analyzing their efficiency. It serves as the primary textbook of choice for algorithm design courses and interview self-study, while maintaining its status as the premier practical reference guide to algorithms for programmers, researchers, and students. The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Practical Algorithm Design, provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, the Hitchhiker's Guide to Algorithms, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations, and an extensive bibliography. NEW to the third edition: -- New and expanded coverage of randomized algorithms, hashing, divide and conquer, approximation algorithms, and quantum computing -- Provides full online support for lecturers, including an improved website component with lecture slides and videos -- Full color illustrations and code instantly clarify difficult concepts -- Includes several new "war stories" relating experiences from real-world applications -- Over 100 new problems, including programming-challenge problems from LeetCode and Hackerrank. -- Provides up-to-date links leading to the best implementations available in C, C++, and Java Additional Learning Tools: -- Contains a unique catalog identifying the 75 algorithmic problems that arise most often in practice, and the right path to solve them -- Exercises include "job interview problems" from major software companies -- Highlighted "take home lessons" emphasize essential concepts -- The "no theorem-proof" style provides a uniquely accessible and intuitive approach to a challenging subject -- Many algorithms are presented with actual code (written in C) -- Provides comprehensive references to both survey articles and the primary literature This substantially enhanced third edition of The Algorithm Design Manual is an essential learning tool for students and professionals needed a solid grounding in algorithms. Professor Skiena is also the author of the popular Springer texts, The Data Science Design Manual and Programming Challenges: The Programming Contest Training Manual.
650 0 _aComputer programming.
_94169
650 0 _aAlgorithms.
_93390
650 0 _aComputer science.
_99832
650 0 _aComputer science—Mathematics.
_931682
650 0 _aDiscrete mathematics.
_912873
650 1 4 _aProgramming Techniques.
_966682
650 2 4 _aDesign and Analysis of Algorithms.
_931835
650 2 4 _aTheory of Computation.
_966683
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
710 2 _aSpringerLink (Online service)
_966684
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030542559
776 0 8 _iPrinted edition:
_z9783030542573
776 0 8 _iPrinted edition:
_z9783030542580
830 0 _aTexts in Computer Science,
_x1868-095X
_966685
856 4 0 _uhttps://doi.org/10.1007/978-3-030-54256-6
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
942 _cETB
999 _c81700
_d81700