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

madio

The motivation for writing this book was the lack of resources available about data
8 Y7 V1 w% m5 E6 w( S" ?* c' \. m1 bstructures and algorithms written in JavaScript. This was strange to me because
/ f- ]3 [. W! T: ]today many of the job opportunities for software development require knowledge of
; O8 @  @7 n) b' L: ?5 \# N% oJavaScript; it is the only language that can be used to write the entire stack, including the
' L7 i+ d4 O# ]+ x2 afront-end, mobile (native and hybrid) platforms, and back-end. It is crucial for JavaScript
# _" t; ]$ y" x1 S' H% F( qdevelopers to understand how data structures work and how to design algorithms to
1 l8 \8 J- o3 L7 m8 \$ o, ibuild applications.
Therefore, this book aims to teach data structure and algorithm concepts from
; i1 t+ D0 Y) S6 O! Xcomputer science for JavaScript rather than for the more typical Java or C++. Because
0 [3 z8 j2 i  K) c: DJavaScript follows the prototypal inheritance pattern, unlike Java and C++ (which follow
the inheritance pattern), there are some changes in writing data structures in JavaScript.
The classical inheritance pattern allows inheritance by creating a blueprint-like
form
7 Y: n& A1 a1 b: ?# g9 `that objects follow during inheritance. However, the prototypal inheritance pattern
" L  K. @4 o# O1 M6 Umeans copying the objects and changing their properties.
) T9 R, `# }# \. w: h+ Q1 ]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
* ~. n  {, N7 r! R! j% {3 c/ rlists, 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.