JavaScript Data Structures and Algorithms超经典的算法书！

madio

The motivation for writing this book was the lack of resources available about data
: X9 m. D8 I1 f& X1 |  istructures and algorithms written in JavaScript. This was strange to me because
today many of the job opportunities for software development require knowledge of
JavaScript; it is the only language that can be used to write the entire stack, including the
* H7 Z% D) B. B: g5 K1 nfront-end, mobile (native and hybrid) platforms, and back-end. It is crucial for JavaScript
5 u( h( [$ q8 \  @; m/ u& @) Udevelopers to understand how data structures work and how to design algorithms to
' _- [$ W8 A. y0 o5 D) Ibuild applications.
Therefore, this book aims to teach data structure and algorithm concepts from
computer science for JavaScript rather than for the more typical Java or C++. Because
JavaScript follows the prototypal inheritance pattern, unlike Java and C++ (which follow
the inheritance pattern), there are some changes in writing data structures in JavaScript.
( B+ D7 G/ G4 l9 `1 _The classical inheritance pattern allows inheritance by creating a blueprint-like
5 K4 d: F/ D+ a: y9 ?4 T5 Tform
3 H. n5 K4 g9 n' A1 R* othat objects follow during inheritance. However, the prototypal inheritance pattern
means copying the objects and changing their properties.
This book first covers fundamental mathematics for Big-O analysis and then lays out
the basic JavaScript foundations, such as primitive objects and types. Then, this book
covers implementations and algorithms for fundamental data structures such as linked
* E5 {( i2 ?0 }+ Jlists, stacks, trees, heaps, and graphs. Finally, more advanced topics such as efficient
string search algorithms, caching algorithms, and dynamic programming problems are
! Y& H' b# t$ l( oexplored in great detail.
8 a  J# G4 h. W3 a) H$ L) M
, e* n  N8 c, T% r  T% o