Easy Learning Data Structures & Algorithms Javascript: Classic data structures and algorithms in JavaScript
暫譯: 輕鬆學習資料結構與演算法:JavaScript中的經典資料結構與演算法

Hu, Yang

  • 出版商: Independently Published
  • 出版日期: 2019-05-27
  • 售價: $1,800
  • 貴賓價: 9.5$1,710
  • 語言: 英文
  • 頁數: 214
  • 裝訂: Quality Paper - also called trade paper
  • ISBN: 1070445185
  • ISBN-13: 9781070445182
  • 相關分類: JavaScriptAlgorithms-data-structures
  • 海外代購書籍(需單獨結帳)

相關主題

商品描述

Understand data structures and the associated algorithms, as well as the context in which they are used.Master existing JavaScript data structures such as array, set and map and learn how to implement new ones such as stacks, linked lists, trees and graphs.All concepts are explained in an easy way, followed by examples.You will gain an in-depth knowledge of how hash tables and set data structure functions, as well as how trees and hash maps This book is an accessible route deeper into JavaScript. Graphs being one of the most complex data structures you'll encounter.1. Bubble Sorting Algorithm2. Select Sorting Algorithm3. Insert Sorting Algorithm4. Dichotomy Binary Search5. Unidirectional Linked List5.1 Create and Initialization5.2 Add Node5.3 Insert Node5.4 Delete Node6. Doubly Linked List6.1 Create and Initialization6.2 Add Node6.3 Insert Node6.4 Delete Node7. One-way Circular LinkedList7.1 Initialization and Traversal7.2 Insert Node7.3 Delete Node8. Two-way Circular LinkedList8.1 Initialization and Traversal8.2 Insert Node8.3 Delete Node9. Queue10. Stack11. Recursive Algorithm12. Two-way Merge Algorithm13. Quick Sort Algorithm14. Binary Search Tree 14.1 Construct a binary search tree 14.2 Binary search tree In-order traversal 14.3 Binary search tree Pre-order traversal 14.4 Binary search tree Post-order traversal 14.5 Binary search tree Maximum and minimum 14.6 Binary search tree Delete Node15. Binary Heap Sorting16. Hash Table17. Graph 17.1 Undirected Graph and Depth-Frst Search 17.2 Undirected Graph and Breadth-First Search 17.3 Directed Graph and Depth-Frst Search 17.4 Directed Graph and Breadth-First Search 17.5 Directed Graph Topological Sorting

商品描述(中文翻譯)

了解資料結構及其相關演算法,以及它們所使用的上下文。掌握現有的 JavaScript 資料結構,如陣列(array)、集合(set)和映射(map),並學習如何實作新的資料結構,如堆疊(stacks)、鏈結串列(linked lists)、樹(trees)和圖(graphs)。所有概念都以簡單的方式解釋,並附有範例。您將深入了解哈希表(hash tables)和集合資料結構的運作方式,以及樹和哈希映射的功能。本書是深入了解 JavaScript 的可及途徑。圖是您將遇到的最複雜的資料結構之一。

1. 冒泡排序演算法
2. 選擇排序演算法
3. 插入排序演算法
4. 二分搜尋法
5. 單向鏈結串列
5.1 創建與初始化
5.2 添加節點
5.3 插入節點
5.4 刪除節點
6. 雙向鏈結串列
6.1 創建與初始化
6.2 添加節點
6.3 插入節點
6.4 刪除節點
7. 單向循環鏈結串列
7.1 初始化與遍歷
7.2 插入節點
7.3 刪除節點
8. 雙向循環鏈結串列
8.1 初始化與遍歷
8.2 插入節點
8.3 刪除節點
9. 隊列(Queue)
10. 堆疊(Stack)
11. 遞迴演算法
12. 雙向合併演算法
13. 快速排序演算法
14. 二元搜尋樹
14.1 建構二元搜尋樹
14.2 二元搜尋樹的中序遍歷
14.3 二元搜尋樹的前序遍歷
14.4 二元搜尋樹的後序遍歷
14.5 二元搜尋樹的最大值與最小值
14.6 二元搜尋樹刪除節點
15. 二元堆排序
16. 哈希表
17. 圖
17.1 無向圖與深度優先搜尋
17.2 無向圖與廣度優先搜尋
17.3 有向圖與深度優先搜尋
17.4 有向圖與廣度優先搜尋
17.5 有向圖的拓撲排序