Learning JavaScript Data Structures and Algorithms, 3/e (Paperback)
暫譯: 學習 JavaScript 資料結構與演算法(第三版,平裝本)
Loiane Groner
- 出版商: Packt Publishing
- 出版日期: 2018-04-26
- 售價: $2,000
- 貴賓價: 9.5 折 $1,900
- 語言: 英文
- 頁數: 426
- 裝訂: Paperback
- ISBN: 1788623878
- ISBN-13: 9781788623872
-
相關分類:
JavaScript、Algorithms-data-structures
-
相關翻譯:
學習JavaScript數據結構與算法 第3版 (簡中版)
相關主題
商品描述
Key Features
- Implement common 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 in ES 8.
- Develop abstract data types to extend JavaScript into a more flexible and powerful programming language
Book Description
A data structure is a particular way of organizing data in a computer to utilize resources efficiently. Data structures and algorithms are the base of every solution to any programming problem. With this book you will learn to write complex and powerful code using the latest ES 8 features.
This book begins by covering basics of the JavaScript language and introducing ECMAScript 8, before gradually moving on to the most important data structures such as array, queue, stack, and linked list. You will gain an in-depth knowledge of how hash tables and set data structure functions, as well as how trees and hash maps can be used to search files in a HD or represent a database. This book is an accessible route deeper into JavaScript. Graphs being one of the most complex data structures you'll encounter, we'll also give you a better understanding of why and how graphs are largely used in GPS navigation systems in social networks.
Toward the end of the book, you'll discover how all the theories presented by this book can be applied in real-world solutions while working on your own computer networks and Facebook searches.
What you will learn
- Declare, initialize, add, and remove items from array, stack, and queue.
- Create and use linked lists, doubly linked lists and circular linked lists.
- Store unique elements with hash table, dictionaries, and set.
- Use the binary tree and binary search tree.
- Get the knack of using algorithms such as DFS (Depth-first Search) and BFS (Breadth-First Search) for the most complex data structures
- Sort data structures using a range of algorithms such as bubble sort, selection sort, insertion sort, merge sort and quick sort.
- Search elements in data structures using sequential sort and binary search.
商品描述(中文翻譯)
**主要特點**
- 實作常見的資料結構及其相關演算法,以及它們使用的背景。
- 精通現有的 JavaScript 資料結構,如陣列(array)、集合(set)和映射(map),並學習如何在 ES 8 中實作新的資料結構,如堆疊(stacks)、鏈結串列(linked lists)、樹(trees)和圖(graphs)。
- 開發抽象資料類型,將 JavaScript 擴展為更靈活且強大的程式語言。
**書籍描述**
資料結構是以特定方式在電腦中組織資料,以有效利用資源。資料結構和演算法是解決任何程式設計問題的基礎。透過本書,您將學會使用最新的 ES 8 特性撰寫複雜且強大的程式碼。
本書首先介紹 JavaScript 語言的基礎知識,並引入 ECMAScript 8,然後逐步深入到最重要的資料結構,如陣列、佇列(queue)、堆疊和鏈結串列。您將深入了解哈希表(hash tables)和集合資料結構的運作方式,以及樹和哈希映射如何用於在硬碟(HD)中搜尋檔案或表示資料庫。本書是深入了解 JavaScript 的可接觸途徑。圖是您將遇到的最複雜的資料結構之一,我們也將幫助您更好地理解為什麼以及如何在社交網路的 GPS 導航系統中廣泛使用圖。
在書的結尾,您將發現本書所介紹的所有理論如何應用於實際解決方案,並在自己的電腦網路和 Facebook 搜尋中進行實作。
**您將學到的內容**
- 宣告、初始化、添加和移除陣列、堆疊和佇列中的項目。
- 創建和使用鏈結串列、雙向鏈結串列和圓形鏈結串列。
- 使用哈希表、字典和集合儲存唯一元素。
- 使用二元樹(binary tree)和二元搜尋樹(binary search tree)。
- 掌握使用演算法,如 DFS(深度優先搜尋)和 BFS(廣度優先搜尋)來處理最複雜的資料結構。
- 使用各種演算法,如氣泡排序(bubble sort)、選擇排序(selection sort)、插入排序(insertion sort)、合併排序(merge sort)和快速排序(quick sort)來排序資料結構。
- 使用順序搜尋(sequential sort)和二元搜尋(binary search)在資料結構中搜尋元素。