算法设计与分析基础

出版社:清华大学出版社
出版日期:2003-8
ISBN:9787302067962
作者:乐威汀 (Anany Levitin)
页数:493页

前言

  Algorithms play the central role in both the science and the practice ofcomputing. Recognition of this fact has led to the appearance of a con-siderable number of textbooks on the subject. By and large, they follow one oftwo alternatives in presenting algorithms One classifies algorithms accordingto a problem type. Such a book would have separate chapters on algorithms forsorting, searching, graphs, and so on. The advantage of this approach is that itallows an immediate comparison of, say, the efficiency of different algorithmsfor the same problem. The drawback of this approach is that it emphasizesproblem types at the expense of algorithm design techniques.  The second alternative organizes the presentation around algorithm de-sign techniques. In this organization, algorithms from different areas of com-puting are grouped together if they have the same design approach. I sharethe belief of many (e.g., [BAY95]) that this organization is more appropri-ate for the basic course on the design and analysis of algorithms. There arethree principal reasons for emphasis on algorithm design techniques First,these techniques provide a student with tools for designing algorithms for newproblems. This makes learning algorithm design technique a very valuableendeavor from the practical standpoint. Second, they seek to classify multi-tudes of known algorithms according to an underlying design idea. Learn-ing to see such commonality among algorithms from different applicationareas should be a major goal of computer science education.

内容概要

Anany Levitin是Villanova大学计算机科学系的教授。于2000年4月发表了“算法设计技术新途径”一文,获得业内高度认同。

书籍目录

Preface1 Introduction2 Fundamentals of the Analysis of Algorithm Efficiency3 Brute Force4 Divide-and-Conquer5 Decrease-and-Conquer6 Transform-and-Conquer7 Space and time Tradeoffs8 Dynamic Programming9 Greedy Technique10 Limitations of Algorithm Power11 Coping with the Limitations of Algorithm Power EqilogueAPPENDIX A Useful Formulas for the Analysis of AlgorithmsAPPENDIX B Short Tutorial on Recurrence RelationsBibliographyHints to ExercisesIndex

作者简介

《算法设计与分析基础(影印版)》由清华大学出版社出版。

图书封面


 算法设计与分析基础下载 更多精彩书评



发布书评

 
 


精彩书评 (总计1条)

  •     如果说CLR是牛津高阶,那这本书就是麦克米伦。作为一本introduction的书籍,更注重的是概念的讲解分析,应用方法。没有具体的算法证明,毕竟CLR有1000多页。这本书的分类也很有特点,算法的分类不再是传统的——数据结构,搜索,排序;而是根据算法的特点分类——divide and conquer, decrease and conquer, backtracking等等。而且书后练习题也相当有趣不足的是有些比较复杂的算法的伪代码简洁的有偷懒的嫌疑,还有就是影印版印刷的实在是……字比一般书要小,初看有点费劲

精彩短评 (总计4条)

  •     印刷的字体太小。看起来很不爽。这本书的印刷质量总体感觉不好。
  •     从方法的角度解析算法,角度独特
  •     分类的介绍了常用算法是一本不错的算法书结合算法导论看效果不错只是搞不懂为什么要32开看着及其费力
  •     入门不错
 

外国儿童文学,篆刻,百科,生物科学,科普,初中通用,育儿亲子,美容护肤PDF图书下载,。 零度图书网 

零度图书网 @ 2024