Beginning Algorithms

Description:

Beginning Algorithms

A good understanding of algorithms, and the knowledge of when to apply them, is crucial to producing software that not only works correctly, but also performs efficiently. This is the only book to impart all this essential information-from the basics of algorithms, data structures, and performance characteristics to the specific algorithms used in development and programming tasks.

Packed with detailed explanations and instructive examples, the book begins by offering you some fundamental data structures and then goes on to explain various sorting algorithms. You'll then learn efficient practices for storing and searching by way of hashing, trees, sets, and maps. The authors also share tips on optimization techniques and ways to avoid common performance pitfalls. In the end, you'll be prepared to build the algorithms and data structures most commonly encountered in day-to-day software development.

What you will learn from this book

• The basics of algorithms, such as iteration and recursion
• Elementary data structures such as lists, stacks, and queues
• Basic and advanced sorting algorithms including insertion sort, quicksort, and shell sort
• Advanced data structures such as binary trees, ternary trees, and heaps
• Algorithms for string searching, string matching, hashing, and computational geometry
• How to use test-driven development techniques to ensure your code works as intended
• How to dramatically improve the performance of your code with hands-on techniques for profiling and optimization

Who this book is for

This book is for anyone who develops applications, or is just beginning to do so, and is looking to understand algorithms and data structures. An understanding of computer programming is beneficial.

Wrox Beginning guides are crafted to make learning programming languages and technologies easier than you think, providing a structured, tutorial format that will guide you through all the techniques involved.

 

 

Table of Contents:

Acknowledgments.

Introduction.

Chapter 1: Getting Started.

Chapter 2: Iteration and Recursion.

Chapter 3: Lists.

Chapter 4: Queues.

Chapter 5: Stacks.

Chapter 6: Basic Sorting.

Chapter 7: Advanced Sorting.

Chapter 8: Priority Queues.

Chapter 9: Binary Searching and Insertion.

Chapter 10: Binary Search Trees.

Chapter 11: Hashing.

Chapter 12: Sets.

Chapter 13: Maps.

Chapter 14: Ternary Search Trees.

Chapter 15: B-Trees.

Chapter 16: String Searching.

Chapter 17: String Matching.

Chapter 18: Computational Geometry.

Chapter 19: Pragmatic Optimization.

Appendix A: Further Reading.

Appendix B: Resources.

Appendix C: Bibliography.

Appendix D: Answers to Exercises.

Index.

描述：
《Beginning Algorithms》是一本介紹算法的書籍，深入解釋了何時應用算法的知識對於開發軟體的重要性，不僅能確保軟體正確運作，還能提高效能。這本書從算法的基礎知識、資料結構和效能特性，到開發和程式設計任務中使用的具體算法，提供了所有這些必要的資訊。

書中詳細解釋並提供了豐富的示例，首先介紹了一些基本的資料結構，然後解釋了各種排序算法。接著，您將學習使用哈希、樹、集合和映射進行高效的儲存和搜索。作者還分享了優化技巧和避免常見性能問題的方法。最後，您將能夠應用於日常軟體開發中最常遇到的算法和資料結構。

本書的學習重點包括：
- 算法的基礎知識，如迭代和遞歸
- 列表、堆疊和佇列等基本資料結構
- 插入排序、快速排序和希爾排序等基本和高級排序算法
- 二元樹、三元樹和堆等高級資料結構
- 字串搜索、字串匹配、哈希和計算幾何等算法
- 使用測試驅動開發技術確保程式碼正確運作
- 使用實踐技巧進行性能分析和優化，大幅提升程式碼效能

本書適合任何開發應用程式的人，無論是初學者還是有經驗的開發者，都能從中獲得對算法和資料結構的理解。對於具備計算機編程知識的讀者尤其有益。

《Beginning Algorithms》是Wrox Beginning系列的一部分，以結構化的教學形式，使學習程式語言和技術變得更加容易。

目錄：
- 致謝
- 簡介
- 第1章：入門
- 第2章：迭代和遞歸
- 第3章：列表
- 第4章：佇列
- 第5章：堆疊
- 第6章：基本排序
- 第7章：高級排序
- 第8章：優先佇列
- 第9章：二元搜索和插入
- 第10章：二元搜尋樹
- 第11章：哈希
- 第12章：集合
- 第13章：映射
- 第14章：三元搜尋樹
- 第15章：B樹
- 第16章：字串搜索