Data Structures and Algorithms with JavaScript (Paperback) (使用 JavaScript 的資料結構與演算法)

Michael McMillan

Data Structures and Algorithms with JavaScript (Paperback)

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

相關主題

商品描述

As an experienced JavaScript developer moving to server-side programming, you need to implement classic data structures and algorithms associated with conventional object-oriented languages like C# and Java. This practical guide shows you how to work hands-on with a variety of storage mechanisms—including linked lists, stacks, queues, and graphs—within the constraints of the JavaScript environment.

Determine which data structures and algorithms are most appropriate for the problems you’re trying to solve, and understand the tradeoffs when using them in a JavaScript program. An overview of the JavaScript features used throughout the book is also included.

This book covers:

  • Arrays and lists: the most common data structures
  • Stacks and queues: more complex list-like data structures
  • Linked lists: how they overcome the shortcomings of arrays
  • Dictionaries: storing data as key-value pairs
  • Hashing: good for quick insertion and retrieval
  • Sets: useful for storing unique elements that appear only once
  • Binary Trees: storing data in a hierarchical manner
  • Graphs and graph algorithms: ideal for modeling networks
  • Algorithms: including those that help you sort or search data
  • Advanced algorithms: dynamic programming and greedy algorithms

商品描述(中文翻譯)

作為一位有經驗的 JavaScript 開發者轉向伺服器端程式設計，您需要實現與傳統物件導向語言（如 C# 和 Java）相關的經典資料結構和演算法。這本實用指南將向您展示如何在 JavaScript 環境的限制下，親自操作各種儲存機制，包括連結串列、堆疊、佇列和圖形。

您將學習如何確定哪些資料結構和演算法最適合解決您所面臨的問題，並了解在 JavaScript 程式中使用它們時的權衡。書中還包括了 JavaScript 功能的概述。

本書涵蓋以下內容：
- 陣列和串列：最常見的資料結構
- 堆疊和佇列：更複雜的類似串列的資料結構
- 連結串列：如何克服陣列的缺點
- 字典：以鍵值對的形式儲存資料
- 雜湊：適用於快速插入和檢索
- 集合：用於儲存僅出現一次的唯一元素
- 二元樹：以階層方式儲存資料
- 圖形和圖形演算法：用於建模網路的理想選擇
- 演算法：包括幫助您對資料進行排序或搜尋的演算法
- 高級演算法：動態規劃和貪婪演算法

以上是本書的內容概述。

類似商品