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

madio

The motivation for writing this book was the lack of resources available about data
/ |; K: `8 v. t/ Q. kstructures and algorithms written in JavaScript. This was strange to me because
today many of the job opportunities for software development require knowledge of
: m( L$ X) X: `JavaScript; it is the only language that can be used to write the entire stack, including the
9 o4 ~% Q- t$ u# Q& U  e/ ~front-end, mobile (native and hybrid) platforms, and back-end. It is crucial for JavaScript
developers to understand how data structures work and how to design algorithms to
8 V' q3 s  O3 @9 I0 K& sbuild 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
% H6 g. D* {1 v* N: Z( a! D7 k3 bJavaScript follows the prototypal inheritance pattern, unlike Java and C++ (which follow
the inheritance pattern), there are some changes in writing data structures in JavaScript.
& Y( ^/ c) l, ~2 k5 z* dThe classical inheritance pattern allows inheritance by creating a blueprint-like
: G+ O9 n6 g: tform
- l( T5 N/ P8 P/ O% N6 z8 mthat 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
# t6 O" v! B. g( mthe basic JavaScript foundations, such as primitive objects and types. Then, this book
8 Y5 r8 ~- y. h( T0 B) c' ccovers implementations and algorithms for fundamental data structures such as linked
lists, stacks, trees, heaps, and graphs. Finally, more advanced topics such as efficient
# P2 ^) W% M+ n- |string search algorithms, caching algorithms, and dynamic programming problems are
8 U# ?9 l5 Z3 v3 }2 [- Yexplored in great detail.
5 \1 X' I1 |6 B