The Art of Algorithm Design

個数:

The Art of Algorithm Design

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

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Paperback:紙装版/ペーパーバック版/ページ数 298 p.
  • 言語 ENG
  • 商品コード 9780367555269
  • DDC分類 005.13

Full Description

The Art of Algorithm Design is a complementary perception of all books on algorithm design and is a roadmap for all levels of learners as well as professionals dealing with algorithmic problems. Further, the book provides a comprehensive introduction to algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. All algorithms are described and designed with a "pseudo-code" to be readable by anyone with little knowledge of programming.

This book comprises of a comprehensive set of problems and their solutions against each algorithm to demonstrate its executional assessment and complexity, with an objective to:




Understand the introductory concepts and design principles of algorithms and their complexities



Demonstrate the programming implementations of all the algorithms using C-Language



Be an excellent handbook on algorithms with self-explanatory chapters enriched with problems and solutions

While other books may also cover some of the same topics, this book is designed to be both versatile and complete as it traverses through step-by-step concepts and methods for analyzing each algorithmic complexity with pseudo-code examples. Moreover, the book provides an enjoyable primer to the field of algorithms.

This book is designed for undergraduates and postgraduates studying algorithm design.

Contents

Chapter 1. Fundamental Concepts of Data Structure. Chapter 2. Concepts of Algorithms and Recurrences. Chapter 3. Divide-and-Conquer Techniques. Chapter 4. Dynamic Programming. Chapter 5. Greedy Algorithms. Chapter 6. Graph. Chapter 7. Approximation Algorithms. Chapter 8. Matrix Operations, Linear Programming, Polynomial and FFT. Chapter 9. Number Theoretic Algorithms. Chapter 10. Programming Implementations of the Algorithms

最近チェックした商品