Essential Algorithms: A Practical Approach to Computer Algorithms (Paperback)

Rod Stephens

Essential Algorithms: A Practical Approach to Computer Algorithms (Paperback)

買這商品的人也買了...

相關主題

商品描述

A friendly and accessible introduction to the most useful algorithms

Computer algorithms are the basic recipes for programming. Professional programmers need to know how to use algorithms to solve difficult programming problems. Written in simple, intuitive English, this book describes how and when to use the most practical classic algorithms, and even how to create new algorithms to meet future needs. The book also includes a collection of questions that can help readers prepare for a programming job interview.

  • Reveals methods for manipulating common data structures such as arrays, linked lists, trees, and networks
  • Addresses advanced data structures such as heaps, 2-3 trees, B-trees
  • Addresses general problem-solving techniques such as branch and bound, divide and conquer, recursion, backtracking, heuristics, and more
  • Reviews sorting and searching, network algorithms, and numerical algorithms
  • Includes general problem-solving techniques such as brute force and exhaustive search, divide and conquer, backtracking, recursion, branch and bound, and more

In addition, Essential Algorithms features a companion website that includes full instructor materials to support training or higher ed adoptions.

商品描述(中文翻譯)

一本友善且易懂的介紹最實用演算法的入門書籍

電腦演算法是程式設計的基本配方。專業的程式設計師需要知道如何使用演算法來解決困難的程式設計問題。這本書用簡單直觀的英文描述了何時以及如何使用最實用的經典演算法，甚至還介紹了如何創建新的演算法以滿足未來的需求。書中還包含了一系列問題，可以幫助讀者準備程式設計工作面試。

本書內容包括：

- 揭示了操作常見資料結構（如陣列、鏈結串列、樹和網路）的方法
- 討論了高級資料結構，如堆積、2-3樹和B樹
- 探討了一般的問題解決技巧，如分支限界、分治法、遞迴、回溯法、啟發式算法等
- 回顧了排序和搜尋、網路演算法和數值演算法
- 包含了一般的問題解決技巧，如暴力搜索、分治法、回溯法、遞迴、分支限界等

此外，《Essential Algorithms》還提供了一個附帶網站，其中包含完整的教學資料，以支持培訓或高等教育採用。

類似商品