The Algorithm Design Manual, 3/e (Hardcover)

Skiena, Steven S.

買這商品的人也買了...

商品描述

"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. This is a great way to learn how to identify hundreds of problem types." (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)

"The is the most approachable book on algorithms I have."   (Megan Squire, Elon University)

---

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, leading the reader down 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

Written by a well-known algorithms researcher who received the IEEE Computer Science and Engineering Teaching Award, 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.

商品描述(中文翻譯)

「對於這類面試準備,我最喜歡的書是Steven Skiena的《算法設計手冊》。與其他書籍相比,它幫助我更好地理解了圖形問題的普遍性,這些問題應該成為每個工作中的程式設計師的工具包的一部分。該書還涵蓋了基本的數據結構和排序算法,這是一個很好的加分項。每個一頁的內容都有一張簡單的圖片,使其易於記憶。這是學習如何識別數百種問題類型的絕佳方式。」(Steve Yegge,《在Google找到那份工作》)

「Steven Skiena的《算法設計手冊》保持著最佳和最全面的實用算法指南的稱號,幫助識別和解決問題。每個程式設計師都應該閱讀這本書,任何在這個領域工作的人都應該隨手保留這本書。這是一個程式設計師或有志成為程式設計師的人最好的投資。」(Harold Thimbleby,《泰晤士高等教育》)

「隨機翻到一個有趣的算法真是太棒了。這是我唯一一本在學生時代結束後仍然覺得有必要帶著的教科書...這個新版的書真的增添了很多活力!」(Cory Bart,特拉華大學)

「這是我遇到的最易於理解的算法書籍。」(Megan Squire,伊隆大學)

---

這本暢銷經典書籍的全新擴展和更新第三版繼續揭開設計算法和分析效率的「神秘面紗」。它是算法設計課程和面試自學的首選教材,同時也是程式設計師、研究人員和學生的首選實用參考指南。

這本讀者友好的《算法設計手冊》提供了直接訪問組合算法技術的途徑,強調設計而非分析。第一部分《實用算法設計》提供了關於設計和分析計算機算法的易於理解的指導。第二部分《算法之旅指南》旨在供瀏覽和參考,包括算法資源目錄、實現和廣泛的參考文獻。

第三版的新增內容包括:隨機算法、哈希、分治、近似算法和量子計算的全新和擴展覆蓋範圍;為講師提供全面的在線支持,包括改進的網站組件,提供講義和視頻;全彩插圖和代碼立即澄清困難概念;包含幾個新的「戰爭故事」,涉及真實應用經驗;超過100個新問題,包括來自LeetCode和Hackerrank的編程挑戰問題;提供指向C、C++和Java最佳實現的最新鏈接。

其他學習工具包括:獨特的目錄,識別實踐中最常見的75個算法問題,引導讀者找到解決這些問題的正確方法;練習題包括來自主要軟體公司的「面試問題」;突出顯示的「要點」強調基本概念;「無定理證明」的風格提供了一種獨特的易於理解和直觀的方法;許多算法都附有實際代碼(使用C編寫);提供全面的參考資料。

作者簡介

Dr. Steven S. Skiena is Distinguished Teaching Professor of Computer Science at Stony Brook University, with research interests in data science, natural language processing, and algorithms. He was awarded the IEEE Computer Science and Engineering Undergraduate Teaching Award “for outstanding contributions to undergraduate education ...and for influential textbooks and software.”  

作者簡介(中文翻譯)

Dr. Steven S. Skiena 是紐約州立大學石溪分校的計算機科學傑出教學教授,他的研究興趣包括數據科學、自然語言處理和算法。他獲得了IEEE計算機科學和工程本科教學獎,以表彰他對本科教育的傑出貢獻,以及他的影響力教科書和軟件。