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

madio

The motivation for writing this book was the lack of resources available about data
# e! }+ m. P  d- h, S! ~structures 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
front-end, mobile (native and hybrid) platforms, and back-end. It is crucial for JavaScript
, m9 ?% T  x; \+ A" w( \: N3 Hdevelopers to understand how data structures work and how to design algorithms to
; ^; v" i6 [% C, |build 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
$ i, A1 B& }, x7 Gthe inheritance pattern), there are some changes in writing data structures in JavaScript.
. u+ Z6 w3 T8 DThe classical inheritance pattern allows inheritance by creating a blueprint-like
! M# ?5 u5 y+ O2 W# ]; K% E0 Tform
, u: ]- F6 C2 w8 Rthat 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
8 _- q" z0 e/ b8 g) g( pcovers implementations and algorithms for fundamental data structures such as linked
, D: {6 ?, b) |: W( O2 Xlists, stacks, trees, heaps, and graphs. Finally, more advanced topics such as efficient
string search algorithms, caching algorithms, and dynamic programming problems are
explored in great detail.