Practical JavaScript Data Structures and Algorithms

Kashyap Mukkamala

  • 出版商: Packt Publishing
  • 出版日期: 2018-01-29
  • 售價: $1,830
  • 貴賓價: 9.5$1,739
  • 語言: 英文
  • 頁數: 332
  • 裝訂: Paperback
  • ISBN: 1788398556
  • ISBN-13: 9781788398558
  • 相關分類: JavaScriptAlgorithms-data-structures
  • 下單後立即進貨 (約3~4週)

商品描述

Key Features

  • Create custom data structures based on project requirements
  • Learn to optimize code based on space and time complexity
  • Focus more on solving the business problem and less about the technical challenges involved

Book Description

Data structures and algorithms are fundamental building blocks of computer programming. They are critical to any problem, provide a complete solution, and act like reusable code. Using appropriate data structures and having a good understanding of algorithm analysis is key in JavaScript to solving the crisis and ensuring your application is a success. Do you want to build applications that are high-performing and fast? Are you looking for complete solutions to implement complex data structures and algorithms in a practical way? If either of these questions ring a bell, then this book is for you!

You'll start by building stacks and understanding performance and memory implications. You will learn how to pick the right type of queue for the application. You will then use Sets, Maps, and trees, and simplify complex applications using Graphs. You will learn to implement different types of sorting algorithms before gradually calculating and analyzing space time complexity. Finally, you will dive deep into increasing the performance of your application using micro optimizations and memory management.

By the end of the book you will gain the skills and expertise necessary to create and employ various data structures in a way that is demanded by their project or use case.

What you will learn

  • Employ different Algorithms based on the use case and data structure in play
  • Use Backtracking Algorithms to encrypt messages
  • Simplify complex problems using graph data structure based on the application.
  • Build a high performance caching tool using circular queues
  • Generate accurate recommendations for credit card approval chances using Decision Trees
  • Increase the performance of an application using micro optimizations