算法分析导论（英文版）

(原书名：An Introduction to the Analysis of Algorithms)

[放大封面] [放大封底]
分享到：

ISBN：7111186060
丛书名：经典原版书库
作者：美 Robert Sedgewick
出版社：机械工业出版社	原出版社：Pearson Education
上架日期：2006-4-4 14:38:00	出版日期：2006-4-1
页数：492 版次：1-1	装帧：平
开本：16
所属分类：计算机科学理论与基础知识 > 计算理论 > 算法

定价：￥59.00

普通会员价：￥41.30

高级会员价：￥41.30

金书豆豆(What's this?)

种一个豆豆，书价我来定!

读者评论(查看)

内容简介

English reprint edition copyright ~ 2006 by Pearson Education Asia Limited and China Machine Press.
Original English language title: An Introduction to the Analysis of Algorithms (ISBN 0-201-40009-X) by Robert Sedgewick and Philippe Flajolet, Copyright ~ 1996.
All rights reserved.
Published by arrangement with the original publisher, Pearson Education, Inc., publishing as Addison-Wesley.
For sale and distribution in the People's Republic of China exclusively (except Taiwan, Hong Kong SAR and Macau SAR).

TABLE   OF  CONTENTS
CHAPTER ONE" ANALYSIS OF ALGORITHMS
  1.1  Why Analyze an Algorithm?
  1.2  Computational Complexity
  1.3  Analysis of Algorithms
  1.4  Average-Case Analysis
  1.5  Example: Analysis of Quieksort
  1.6  Asymptotic Approximations
  1.7  Distributions
  1.8  Probabilistic Algorithms
CHAPTER TWO: RECURRENCE RELATIONS
  2.1  Basic Properties
  2.2  First-Order Recurrences
  2.3  Nonlinear First-Order Recurrences
  2.4  Higher-Order Recurrences
  2.5  Methods for Solving Recurrences
  2.6  Binary Divide-and-Conquer Recurrences and Binary
        Numbers
  2.7  General Divide-and-Conquer Recurrences
CHAPTER THREE: GENERATING FUNCTIONS
  3.1  Ordinary Generating Functions
  3.2  Exponential Generating Functions
  3.3  Generating Function Solution of Recurrences
  3.4 Expanding Generating Functions
  3.5  Transformations with Generating Functions
  3.6  Functional Equations on Generating Functions
  3.7  Solving the Quicksort Median-of-Three Recurrence
        with OGFs
  3.8  Counting with Generating Functions
  3.9  The Symbolic Method
  3.10 Lagrange Inversion
  3.11 Probability Generating Functions
  3.12 Bivariate Generating Functions
  3.13 Special Functions
CHAPTER FOUR: ASYMPTOTIC APPROXIMATIONS
  4.1  Notation for Asymptotic Approximations
  4.2  Asymptotic Expansions
  4.3  Manipulating Asymptotic Expansions
  4.4  Asymptotic Approximations of Finite Sums
  4.5  Euler-Maclaurin Summation
  4.6  Bivariate Asymptotics
  4.7  Laplace Method
  4.8  "Normal" Examples from the Analysis of Algorithms
  4.9  "Poisson" Examples from the Analysis of Algorithms
  4.10 Generating Function Asymptotics
CHAPTER FIVE: TREES
  5.1  Binary Trees
  5.2  Trees and Forests
  5.3  Properties of Trees
  5.4  Tree Algorithms
  5.5  Binary Search Trees
  5.6  Average Path Length in Catalan Trees
  5.7  Path Length in Binary Search Trees
  5.8  Additive Parameters of Random Trees
  5.9 Height
  5.10 Summary of Average-Case Results on Properties of Trees
  5.11 Representations of Trees and Binary Trees
  5.12 Unordered Trees
  5.13 Labelled Trees
  5.14 Other Types of Trees
CHAPTER  SIX:   PERMUTATIONS
   6.2  Algorithms on Permutations
    6.3  Representations of Permutations
    6.4  Enumeration Problems
    6.5  Analyzing Properties of Permutations with CGFs
    6.6  Inversions and Insertion Sorts
    6.7  Left-to-Right Minima and Selection Sort
    6.8  Cycles and In Situ Permutation
    6.9  Extremal Parameters
CHAPTER SEVEN: STRINGS AND TRIES
  7.1  String Searching
  7.2  Combinatorial Properties of Bitstrings
  7.3  Regular Expressions
  7.4  Finite-State Automata and the Knuth-Morris-Pratt
        Algorithm
  7.5  Context-Free Grammars
  7.6 Tries
  7.7 ride Algorithms
  7.8  Combinatorial Properties of Tries
  7.9  Larger Alphabets
CHAPTER EIGHT: WORDS AND MAPS
  8.1  Hashing with Separate Chaining
  8.2  Basic Properties of Words
  8.3  Birthday Paradox and Coupon Collector Problem
  8.4  Occupancy Restrictions and Extremal Parameters
  8.5  Occupancy Distributions
  8.6  Open Addressing Hashing
  8.7  Maps
  8.8  Integer Factorization and Maps
        List of Theorems
        Index

前言

PREFACE

THIS book is intended to be a thorough overview of the primary tech-niques used in th.. 点击查看更多内容

作者简介

Robert Sedgewick斯坦福大学博士(导师为Donald E.Knuth)，普林斯顿大学计算机科学系教授，Adobe Systems公司董事，曾是Xerox PARC的研究人员，还曾就职于美国国防部防御分析研究所以及INRIA。点击查看更多内容

编辑荐语

[您可以向编辑推荐本书的亮点，采纳后奖励５－１０元优惠卷]（一个工作日内处理您的建议）
分析算法的人享有双重的幸福。首先，他们能够体验到优雅数学模式纯粹的美，这处模式存在于优美的计算过程之中。其次，当他们的理论使得其他工作能够做得更快、更经济时，他们得到的是实际的褒奖。因此，我们盼望已久的这部著作极受欢迎。该书作者不仅是该领域世界范围内的领袖，而且还是阐述的大师。
——Donald E. Knuth