Algorithms （4TH）

個数：

Algorithms （4TH）

Sedgewick, Robert/ Wayne, Kevin

ウェブストア価格 ¥17,449（本体¥15,863）
Addison-Wesley Educational Publishers Inc（2011/03発売）
外貨定価 US$ 89.99
ポイント 158pt

提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
【重要ご説明事項】
1. 納期遅延や、ご入手不能となる場合が若干ございます。
2. 複数冊ご注文の場合、分割発送となる場合がございます。
3. 美品のご指定は承りかねます。

【入荷遅延について】
世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。

◆画像の表紙や帯等は実物とは異なる場合があります。

◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
また、洋書販売価格は、ご注文確定時点での日本円価格となります。
ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。

製本 Hardcover:ハードカバー版／ページ数 976 p.
言語 ENG
商品コード 9780321573513
DDC分類 006.31

Full Description

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