123,123,123

內(nèi)容簡(jiǎn)介

　　本書(shū)提供了在學(xué)習(xí)現(xiàn)代計(jì)算機(jī)算法時(shí)經(jīng)常會(huì)遇到的許多問(wèn)題的答案，可以幫助讀者更好地理解、掌握算法分析與設(shè)計(jì)課程。本書(shū)包括360多個(gè)練習(xí)題，這些練習(xí)題不僅涉及到一些經(jīng)典問(wèn)題，而且包括一些重要的應(yīng)用程序中的熱點(diǎn)問(wèn)題，如文字處理中的段落排版、數(shù)據(jù)壓縮、數(shù)據(jù)庫(kù)系統(tǒng)和Internet搜索引擎等方面的算法問(wèn)題，這些都是現(xiàn)代軟件系統(tǒng)的基本組成部分。本書(shū)可作為高等學(xué)校計(jì)算機(jī)科學(xué)與技術(shù)類(lèi)專(zhuān)業(yè)、數(shù)學(xué)及信息與計(jì)算科學(xué)專(zhuān)業(yè)本科生和研究生“算法分析與設(shè)計(jì)”課程的輔助教材，也可供其他專(zhuān)業(yè)涉及算法設(shè)計(jì)與應(yīng)用的研究和開(kāi)發(fā)人員學(xué)習(xí)參考。

作者簡(jiǎn)介

暫缺《算法題解（英文版）》作者簡(jiǎn)介

圖書(shū)目錄

  Preface
Chapter 1  Mathematical Foundation
  1.1 Growth of Functions
  1.2 Recurrences
  1.3 Exercises & Solutions
Chapter 2  Sorting and Selection
  2.1 Sorting
  2.2 Selection
  2.3 Exercises & Solutions
Chapter 3  Data Structures
  3.1 Elementary Data Structures
  3.2 Dynamic Sets and Searching
  3.3 Exercises & Solutions
Chapter 4  Advanced Data Structures
  4.1 B-Trees
  4.2 Binomial Heaps
  4.3 Fibonacci Heaps
  4.4 Data Structures for Disjoint Sets
  4.5 Exercises & Solutions
Chapter 5  Advanced Design and Analysis Techniques
  5.1 Divide and Conquer
  5.2 Dynamic Programming
  5.3 Greedy Algorithms
  5.4 Amortized Analysis
  5.5 Exercises & Solutions
Chapter 6  Graph Algorithms
  6.1 Elementary Graph Algorithms
  6.2 Minimum Spanning Trees
  6.3 Single-Source Shortest Paths
  6.4 All-Pairs Shortest Paths
  6.6 Exercises & Solutions
Appendix
References