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 還提供一個伴隨網站，包含完整的教學材料，以支持培訓或高等教育的採用。

類似商品

最後瀏覽商品 (20)