Algorithms
著者
書誌事項
Algorithms
Addison-Wesley, c2011
4th ed
- : hardcover
並立書誌 全1件
大学図書館所蔵 全1件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes index
内容説明・目次
内容説明
The leading introduction to computer algorithms in use today, including fifty algorithms every programmer should know
Princeton Computer Science professors, Robert Sedgewick and Kevin Wayne, survey the most important computer algorithms in use and of interest to anyone working in science, mathematics, and engineering, and those who use computation in the liberal arts. They provide a full treatment of data structures and algorithms for key areas that enable you to confidently implement, debug, and put them to work in any computational environment.
Fundamentals:
Basic programming models
Data abstraction
Bags, queues, and stacks
Analysis of algorithms
Sorting
Elementary sorts
Mergesort
Quicksort
Priority queues
Applications
Graphs
Undirected graphs
Directed graphs
Minimum spanning trees
Shortest paths
Strings
String sorts
Tries
Substring search
Regular expressions
Data compression
These algorithms are generally ingenious creations that, remarkably, can each be expressed in just a dozen or two lines of code. As a group, they represent problem-solving power of amazing scope. They have enabled the construction of computational artifacts, the solution of scientific problems, and the development of commercial applications that would not have been feasible without them.
目次
Chapter 1: Fundamentals
1.1 Programming Model
1.2 Data Abstraction
1.3 Queues, Stacks, and Bags
1.4 Analysis of Algorithms
1.5 Case Study: Union-Find
Chapter 2: Sorting
2.1 Elementary Sorts 2.1 Elementary Sorts
2.2 Mergesort
2.3 Quicksort
2.4 Priority Queues
2.5 Applications
Chapter 3: Searching
3.1 Symbol Tables 3.1 Symbol Tables
3.2 Binary Search Trees
3.3 Balanced Search Trees
3.4 Hash Tables
3.5 Applications
Chapter 4: Graphs
4.1 Undirected graphs 4.1 Undirected graphs
4.2 Directed graphs
4.3 Minimum Spanning Trees
4.4 Shortest Paths
Chapter 5: Strings
5.1 String Sorts 5.1 String Sorts
5.2 Tries
5.3 Substring Search
5.4 Regular Expressions
5.5 Data Compression
Context
Systems Programming Systems Programming
Scientific Computing
Commercial Applications
Operations Research
Intractability
Index
「Nielsen BookData」 より