Learning JavaScript Data Structures and Algorithms - Third Edition

Loiane Groner

下單後立即進貨 (1~2週)

相關活動主題

Packt october small

商品描述

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.