What do you think?
Rate this book
JavaScript Data Structures and Algorithms: An Introduction to Understanding and Implementing Core Data Structure and Algorithm Fundamentals
Explore data structures and algorithm concepts and their relation to everyday JavaScript development. A basic understanding of these ideas is essential to any JavaScript developer wishing to analyze and build great software solutions. You'll discover how to implement data structures such as hash tables, linked lists, stacks, queues, trees, and graphs. You'll also learn how a URL shortener, such as bit.ly, is developed and what is happening to the data as a PDF is uploaded to a webpage. This book covers the practical applications of data structures and algorithms to encryption, searching, sorting, and pattern matching. It is crucial for JavaScript developers to understand how data structures work and how to design algorithms. This book and the accompanying code provide that essential foundation for doing so. With JavaScript Data Structures and Algorithms you can start developing your knowledge and applying it to your JavaScript projects today. What You'll Learn Who This Book Is For Existing web developers and software engineers seeking to develop or revisit their fundamental data structures knowledge; beginners and students studying JavaScript independently or via a course or coding bootcamp.
378 pages, Paperback
Published January 24, 2019
39 people are currently reading
52 people want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 - 4 of 4 reviews
March 21, 2021
Good book, but a a lot of examples lack the proper explanation and some are with no explanation at all. Also there are some inaccurate code.
October 4, 2020
I like the book, I read almost every letter, the explanation is correct, but when it comes to code, when I test it in my code editor, the code is wrong and does not work correctly, like in the binary search in Chapter 10, there is something wrong with the while loop , I did PR on GitHub and I fixed it.
In Chapter 4, the writing code for RSA Encryption is a bit vague, he was right but when you study the code carefully it is a bit far from what he said so it is a bit confusing, for example, he explains the private key generation key and public key to encrypt the message using the public key, but when you decrypt the message it comes out differently when using the private key.
I do not say he is wrong, but he did not mention the library to handle the large number, for example, we have a secret message of 2, higher than that will result to incorrect decryption. JavaScript internally uses floating point operation. If the numbers get big you should not be surprised if the answer is incorrect. This is because the prime factorization of large numbers takes time to compute. Today’s standard is 4,096-bit prime product.
The only downside is, he did not mention the library to handle such a large number, for example, there is a big integer library that developers use to handle RSA Encryption to provide the correct result.
But in general, it is good because in the following chapters I learned a lot of concepts, especially in the string searching algorithm in Chapter 18, Classical Dynamic Programming Examples in Chapter 19, and most recently, Chapter 20, the Bit Manipulation especially in Number Operators.
In Chapter 4, the writing code for RSA Encryption is a bit vague, he was right but when you study the code carefully it is a bit far from what he said so it is a bit confusing, for example, he explains the private key generation key and public key to encrypt the message using the public key, but when you decrypt the message it comes out differently when using the private key.
I do not say he is wrong, but he did not mention the library to handle the large number, for example, we have a secret message of 2, higher than that will result to incorrect decryption. JavaScript internally uses floating point operation. If the numbers get big you should not be surprised if the answer is incorrect. This is because the prime factorization of large numbers takes time to compute. Today’s standard is 4,096-bit prime product.
The only downside is, he did not mention the library to handle such a large number, for example, there is a big integer library that developers use to handle RSA Encryption to provide the correct result.
But in general, it is good because in the following chapters I learned a lot of concepts, especially in the string searching algorithm in Chapter 18, Classical Dynamic Programming Examples in Chapter 19, and most recently, Chapter 20, the Bit Manipulation especially in Number Operators.
January 17, 2023
Straightforward, simple and concise approach to explain basic data structures and algorithms.
Some implementations may not be the most appropriate to the time complexity and for this I took off a star. Nonetheless, this is a very good treatment of understanding the foundations of solving problems using computer instructions.
Some implementations may not be the most appropriate to the time complexity and for this I took off a star. Nonetheless, this is a very good treatment of understanding the foundations of solving problems using computer instructions.
June 10, 2024
Subject good. Too much errors in examples.
Displaying 1 - 4 of 4 reviews