算法設(shè)計與分析基礎(chǔ)

前言

　　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.

內(nèi)容概要

本書利用了作者所開發(fā)的算法設(shè)計技術(shù)的最新分類，這種新的分類方法涵蓋了眾多經(jīng)典算法，而采用過去的分類無法以一種一致的方式介紹這些算法。作為通用的問題解決工具，算法設(shè)計技術(shù)得以廣泛的應(yīng)用。尤其是將其應(yīng)用到解決類似封面上那些流行的謎題時，會顯示出其巨大的威力。本書包含了超過600個練習(xí)，包括一些利用萬維多資源的練習(xí)。書中還包括了針對所有練習(xí)的提示，以幫助讀者完全這些練習(xí)。

作者簡介

Anany Levitin是Villanova大學(xué)計算機科學(xué)系的教授。于2000年4月發(fā)表了“算法設(shè)計技術(shù)新途徑”一文，獲得業(yè)內(nèi)高度認同。

書籍目錄

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

圖書封面

圖書標(biāo)簽Tags

無

評論、評分、閱讀與下載

---

    算法設(shè)計與分析基礎(chǔ) PDF格式下載

---