标题: JavaScript Data Structures and Algorithms超经典的算法书！ [打印本页] 作者: madio 时间: 2020-2-25 12:21 标题: JavaScript Data Structures and Algorithms超经典的算法书！ The motivation for writing this book was the lack of resources available about data - u, T J* I5 s& J! E6 U' `7 Wstructures and algorithms written in JavaScript. This was strange to me because: \9 U+ w0 B: e- [7 i: _5 q' Y
today many of the job opportunities for software development require knowledge of$ j- E- S4 V( x' f7 b
JavaScript; it is the only language that can be used to write the entire stack, including the: a( v2 w8 X* _) E, K9 r8 u% T5 P" s
front-end, mobile (native and hybrid) platforms, and back-end. It is crucial for JavaScript ( F9 _4 A# I- n" P# ?developers to understand how data structures work and how to design algorithms to ( J2 O( \$ Z" t* S4 h4 H* lbuild applications. ' P- x6 j9 G5 y0 R2 C. A) @Therefore, this book aims to teach data structure and algorithm concepts from6 {" E! H7 k; N$ a& U* `
computer science for JavaScript rather than for the more typical Java or C++. Because 5 ?2 m5 W/ r; g( NJavaScript follows the prototypal inheritance pattern, unlike Java and C++ (which follow 3 I$ `3 U' p0 _) P vthe inheritance pattern), there are some changes in writing data structures in JavaScript. ' s& F2 g7 ~ Y, ?: \3 L0 `The classical inheritance pattern allows inheritance by creating a blueprint-like 6 ^9 i0 ?! p7 y- g9 K0 }form / V7 W, Z. L2 m( @" ]9 @( Pthat objects follow during inheritance. However, the prototypal inheritance pattern 8 j( O/ j, w/ o2 tmeans copying the objects and changing their properties. " E' X2 k* e/ [- F- i& [9 qThis book first covers fundamental mathematics for Big-O analysis and then lays out . Q, i/ ^6 u3 U! athe basic JavaScript foundations, such as primitive objects and types. Then, this book! U, M% R3 V2 Q0 \/ {8 o4 V
covers implementations and algorithms for fundamental data structures such as linked ' E4 [ a3 ~- q2 z0 l- F+ a/ ilists, stacks, trees, heaps, and graphs. Finally, more advanced topics such as efficient # _' b8 x- G) U( C# Ostring search algorithms, caching algorithms, and dynamic programming problems are" a0 `0 a# \ u: C9 ?
explored in great detail.5 e) W, d7 G, O: C
& W" c! y# U2 }* v9 p
