收藏
The Algorithm Design Manual - Steven S Skiena

The Algorithm Design Manual

Steven S Skiena

出版社

Springer

出版时间

2011-11-14

ISBN

9781848000698

评分

★★★★★

标签

算法algorithm计算机计算机科学

书籍介绍
....The most comprehensive guide to designing practical and efficient algorithms.... Written by a well-known algorithms researcher who received the IEEE Computer Science and Engineering Teaching Award, this new edition of The Algorithm Design Manual is an essential learning tool for students needing a solid grounding in algorithms, as well as a special text/reference for professionals who need an authoritative and insightful guide. Professor Skiena is also author of the popular Springer text, Programming Challenges: The Programming Contest Training Manual.
AI导读
核心看点
  • 作者获IEEE教学奖，内容直观易懂
  • 侧重实用算法设计与工程实现细节
  • 包含大量面试真题与解题策略指导
适合谁读
  • 准备技术面试，需快速复习算法的程序员
  • 有一定基础，寻求算法实战技巧的开发者
  • 作为CLRS等教材补充的工具书查阅者
读前提醒
  • 非零基础入门书，需具备编程基础
  • 部分推导较简略，建议配合经典教材
  • 重点阅读第二部分实例分析与解题思路
读者共识
  • 面试刷题利器，讲解生动不装逼
  • 不适合初学者，但胜在实用接地气
  • 动态规划与回溯章节评价极高

本导读基于书籍简介、目录、原文摘录、短评和书评生成，不等同于全文精读。

精彩摘录
  • "Typical computer science students study the basic sorting algorithms at least three times before they graduate: first in introductory programming, then in data structures, and finally in their algorithms course."
  • "When you have morethan 100 items to sort, it is important to use an O(nlgn)-time algorithm like heapsort, quicksort, or mergesort. ... Once you get past (say) 5,000,000 items, it is important to start thinking about external-memory sorting algorithms that minimize disk access."
  • "If you are determined to implement your own quicksort, use the following heuristics, which make a big difference in practice: * Use ranomization * Median of three * Leave small subarrays for insertion sort * Do the smaller partition first"
作者简介
Steven Skiena (1961-, http://www.cs.sunysb.edu/~skiena/) is a Professor of Computer Science in State University of New York at Stony Brook
用户评论
这是一本中级算法书，之前没有编程基础看此书很可能会觉得没讲明白。 特点正如标题所示是手册：简短的语言总结和比较了种种算法与数据结构。无怪Steve Yegge推荐给程序员面试前复习算法用。学习算法不建议用这本，而应该选择更详细全面的CLRS或者Kleinberg&Tardos
当年找工作看得这个，非常赞 习题做的不多 内容简洁清晰
Solves the question of whether having sex with someone is unidirectional or not.
相见恨晚
不适合入门，当工具书很不错的！
重在实践。不适合作为第一本算法书 但或许可以是最后一本。
可以一直看下去。。。
假装看完了
看了很长时间，非常好。
Springer的其他书籍查看全部

收藏