Learning JavaScript Data Structures and Algorithms, 3/e (Paperback) (學習 JavaScript 資料結構與演算法(第三版))

Loiane Groner

相關主題

商品描述

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 資料結構,如陣列、集合和映射,並學習如何在 ES 8 中實現新的資料結構,如堆疊、鏈結串列、樹和圖。

  • 開發抽象資料類型,將 JavaScript 擴展為更靈活和強大的程式語言。

書籍描述

資料結構是一種特定的方式,用於在電腦中有效利用資源組織資料。資料結構和演算法是解決任何程式設計問題的基礎。通過本書,您將學習使用最新的 ES 8 功能編寫複雜且強大的程式碼。

本書首先介紹 JavaScript 語言的基礎知識,並引入 ECMAScript 8,然後逐步深入介紹最重要的資料結構,如陣列、佇列、堆疊和鏈結串列。您將深入了解哈希表和集合資料結構的運作方式,以及如何使用樹和哈希映射來搜索硬碟中的檔案或表示資料庫。本書是深入研究 JavaScript 的一條可行路徑。圖形是最複雜的資料結構之一,我們還將更好地理解為什麼以及如何在 GPS 導航系統和社交網絡中廣泛使用圖形。

在本書的最後,您將發現如何將本書介紹的所有理論應用於實際解決方案,並在自己的電腦網絡和 Facebook 搜索中使用。

你將學到什麼


  • 聲明、初始化、添加和刪除陣列、堆疊和佇列中的項目。

  • 創建和使用鏈結串列、雙向鏈結串列和循環鏈結串列。

  • 使用哈希表、字典和集合存儲唯一元素。

  • 使用二元樹和二元搜尋樹。

  • 掌握使用 DFS(深度優先搜尋)和 BFS(廣度優先搜尋)等演算法處理最複雜的資料結構。

  • 使用各種演算法對資料結構進行排序,如冒泡排序、選擇排序、插入排序、合併排序和快速排序。

  • 使用順序搜尋和二分搜尋在資料結構中搜索元素。