Book Overview & Buying
Table Of Contents

Hands-On Data Structures and Algorithms with JavaScript

By : Mukkamala

4 (3)

Buy this Book

Hands-On Data Structures and Algorithms with JavaScript

4 (3)

By: Mukkamala

Buy this Book

Overview of this book

Data structures and algorithms are the 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 are key in JavaScript to solving crises and ensuring your application is less prone to errors. 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 rings 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, trees, and graphs to simplify complex applications. You will learn to implement different types of sorting algorithm before gradually calculating and analyzing space and time complexity. Finally, you'll increase the performance of your application using micro optimizations and memory management. By the end of the book you will have gained the skills and expertise necessary to create and employ various data structures in a way that is demanded by your project or use case.

Preface

Who this book is for

What this book covers

To get the most out of this book

Get in touch

Free Chapter

Building Stacks for Application State Management

Prerequisites

Terminology

API

Don't we have arrays for this?

Creating a stack

Use cases

Summary

Creating Queues for In-Order Executions

Types of queue

Implementing APIs

Creating a queue

Use cases for queues

Comparing performance

Summary

Using Sets and Maps for Faster Applications

Exploring the origin of sets and maps

Analyzing set and map types

Sets versus WeakSets

Use cases

Performance comparison

Summary

Using Trees for Faster Lookup and Modifications

Creating an Angular application

Creating a typeahead lookup

Creating a credit card approval predictor

Simplify Complex Applications Using Graphs

Types of graphs

Use cases

Exploring Types of Algorithms

Creating a Node.js application

Use cases

Summary

Sorting and Its Applications

Types of sorting algorithms

Use cases of different sorting algorithms

Big O Notation, Space, and Time Complexity

Terminology

Examples of time complexity

Space complexity and Auxiliary space

Micro-Optimizations and Memory Management

Best practices

HTML optimizations

CSS optimizations

JavaScript optimizations

Summary

What's next?

Other Books You May Enjoy

Leave a review - let other readers know what you think

Using Trees for Faster Lookup and Modifications

Trees are one of the most advanced and complex data structures out there. It opens doors to graph theory, which is used to represent a relationship between objects. The objects can be of any type, and as long as they have an established relationship, it can be represented in the form of a tree.

Although there are tens of trees out there, it is not possible to cover them all in the chapter, so we will take a different approach and learn about trees in a more practical way when we go through the examples, instead of doing it upfront like in previous chapters.

In this chapter, we will be exploring the following topics: