|
1 | | -include::_conf/variables.adoc[] |
2 | | - |
3 | | -= {doctitle} |
4 | | - |
5 | | -// remove numbering from titles, and sub-titles e.g. 1.1 |
6 | | -:sectnums!: |
7 | | - |
8 | | -// Copyright © 2018 Adrian Mejia (g) |
| 1 | += Data Structures and Algorithms Explained in JavaScript |
| 2 | +:book-title: {doctitle} |
| 3 | +:author: Adrian Mejia |
| 4 | +:email: hello+dsajs@adrianmejia.com |
| 5 | +:revnumber: 1.0.0 |
| 6 | +:revdate: {docdate} |
| 7 | +:revyear: 2019 |
| 8 | +:subject: Algorithms |
| 9 | +:keywords: Algorithms, Data Structures, JavaScript, Time Complexity, Linked Lists, Graphs |
| 10 | +:doctype: book |
| 11 | +:media: screen |
| 12 | +:imagesdir: {docdir}/images |
| 13 | +ifeval::["{media}" != "prepress"] |
| 14 | +:front-cover-image: image:cover.png[Front Cover,1050,1600] |
| 15 | +endif::[] |
| 16 | +:toc: |
| 17 | +:icons: font |
| 18 | +:lang: en |
| 19 | +:language: javascript |
| 20 | +:experimental: |
| 21 | +:pdf-fontsdir: ./fonts |
| 22 | +:pdf-stylesdir: ./_resources/pdfstyles |
| 23 | +:pdf-style: infoq-screen |
| 24 | +:title-logo-image: image:logo.png[Logo,50,50] |
| 25 | + |
| 26 | +// custom variables |
| 27 | +:codedir: ../../src |
| 28 | +:datadir: {docdir}/data |
| 29 | +:source-highlighter: pygments |
| 30 | +:pygments-style: xcode |
| 31 | + |
| 32 | + |
| 33 | +ifndef::ebook-format[:leveloffset: 1] |
| 34 | + |
| 35 | +[colophon#colophon%nonfacing] |
9 | 36 | include::chapters/colophon.adoc[] |
10 | 37 |
|
11 | | -// Abstract and Dedication MUST have a level-0 heading in EPUB and Kindle |
12 | | -// but level-1 in PDF and HTML |
13 | | -ifndef::backend-epub3[:leveloffset: +1] |
| 38 | +[dedication] |
14 | 39 | include::chapters/dedication.adoc[] |
15 | | -ifndef::backend-epub3[:leveloffset: -1] |
16 | | - |
17 | | -// (g) |
18 | | -include::chapters/preface.adoc[] |
19 | | - |
20 | | -// add sections to chapters |
21 | | -:sectnums: |
22 | | - |
23 | | - |
24 | | -//----------------------------------- |
25 | | -// TODO: commment out sample on final |
26 | | -//----------------------------------- |
27 | | - |
28 | | -include::chapters/sample.adoc[] |
29 | | - |
30 | | -//----------------------------------- |
31 | | -// TODO: end remove ------ |
32 | | -//----------------------------------- |
33 | | - |
34 | | -// |
35 | | -// chapters |
36 | | -// |
37 | | - |
38 | | -= Algorithms Analysis |
39 | | - |
40 | | -include::chapters/algorithms-analysis-intro.adoc[] |
41 | | - |
42 | | -:leveloffset: +1 |
43 | | - |
44 | | -// (g) |
45 | | -include::chapters/algorithms-analysis.adoc[] |
46 | | - |
47 | | -// (g) |
48 | | -include::chapters/big-o-examples.adoc[] |
49 | | - |
50 | | -:leveloffset: -1 |
51 | | - |
52 | | -= Linear Data Structures |
53 | | - |
54 | | -// (g) |
55 | | -include::chapters/linear-data-structures-intro.adoc[] |
56 | | - |
57 | | -:leveloffset: +1 |
58 | | - |
59 | | -// (g) |
60 | | -include::chapters/array.adoc[] |
61 | | - |
62 | | -// (g) |
63 | | -include::chapters/linked-list.adoc[] |
64 | | - |
65 | | -// (g) |
66 | | -include::chapters/stack.adoc[] |
67 | | - |
68 | | -// (g) |
69 | | -include::chapters/queue.adoc[] |
70 | | - |
71 | | -// (g) |
72 | | -include::chapters/linear-data-structures-outro.adoc[] |
73 | | - |
74 | | -:leveloffset: -1 |
75 | | - |
76 | | - |
77 | | -= Non-Linear Data Structures |
78 | | - |
79 | | -// (g) |
80 | | -include::chapters/non-linear-data-structures-intro.adoc[] |
81 | | - |
82 | | -:leveloffset: +1 |
83 | | - |
84 | | -// (g) |
85 | | -include::chapters/tree.adoc[] |
86 | | - |
87 | | - |
88 | | -// (g) |
89 | | -include::chapters/tree--binary-search-tree.adoc[] |
90 | | - |
91 | | -include::chapters/tree--search.adoc[] |
92 | | - |
93 | | -include::chapters/tree--self-balancing-rotations.adoc[] |
94 | 40 |
|
95 | | -:leveloffset: +1 |
| 41 | +// [%nonfacing] |
| 42 | +// include::chapters/acknowledgements.adoc[] |
96 | 43 |
|
97 | | -include::chapters/tree--avl.adoc[] |
98 | | - |
99 | | -:leveloffset: -1 |
100 | | - |
101 | | -// (g) |
102 | | -// include::chapters/map.adoc[] |
103 | | -include::chapters/map-intro.adoc[] |
104 | | - |
105 | | -:leveloffset: +1 |
106 | | - |
107 | | -// (g) |
108 | | -include::chapters/map-hashmap.adoc[] |
109 | | - |
110 | | -// (g) |
111 | | -include::chapters/map-treemap.adoc[] |
112 | | - |
113 | | -// (g) |
114 | | -include::chapters/map-hashmap-vs-treemap.adoc[] |
115 | | - |
116 | | -:leveloffset: -1 |
117 | | - |
118 | | -// (g) |
119 | | -include::chapters/set.adoc[] |
120 | | - |
121 | | -// (g) |
122 | | -include::chapters/graph.adoc[] |
123 | | - |
124 | | -// TODO: pending |
125 | | -include::chapters/graph-search.adoc[] |
126 | | - |
127 | | -:leveloffset: -1 |
128 | | - |
129 | | -= Algorithms |
130 | | - |
131 | | -// TODO: pending |
132 | | -include::chapters/algorithms-intro.adoc[] |
133 | | - |
134 | | -:leveloffset: +1 |
135 | | - |
136 | | -// |
137 | | -// Sorting algorithms |
138 | | -// |
139 | | -= Sorting Algorithms |
140 | | - |
141 | | -:leveloffset: +1 |
142 | | - |
143 | | -// TODO: pending |
144 | | -include::chapters/sorting-intro.adoc[] |
145 | | - |
146 | | -// Slow Sorting |
147 | | - |
148 | | -include::chapters/insertion-sort.adoc[] |
149 | | - |
150 | | -include::chapters/selection-sort.adoc[] |
151 | | - |
152 | | -include::chapters/bubble-sort.adoc[] |
153 | | - |
154 | | -// Fast Sorting |
155 | | - |
156 | | -include::chapters/merge-sort.adoc[] |
157 | | - |
158 | | -include::chapters/quick-sort.adoc[] |
159 | | - |
160 | | -:leveloffset: -1 |
161 | | - |
162 | | - |
163 | | -// |
164 | | -// Algorithms Techniques |
165 | | -// |
166 | | - |
167 | | -include::chapters/divide-and-conquer.adoc[] |
168 | | - |
169 | | -include::chapters/dynamic-programming.adoc[] |
170 | | - |
171 | | -include::chapters/greedy-algorithms.adoc[] |
172 | | - |
173 | | -include::chapters/backtracking.adoc[] |
174 | | - |
175 | | -// --- end algorithms --- |
176 | | - |
177 | | -:leveloffset: -1 |
| 44 | +[preface] |
| 45 | +include::chapters/preface.adoc[] |
178 | 46 |
|
179 | | -:sectnums!: |
| 47 | +// include::chapters/introduction.adoc[] |
180 | 48 |
|
181 | | -= Appendix |
| 49 | +include::chapters/chapter1.adoc[] |
182 | 50 |
|
183 | | -:leveloffset: +1 |
| 51 | +include::chapters/chapter2.adoc[] |
184 | 52 |
|
185 | | -// TODO: review and complete when the rest is completed |
186 | | -include::chapters/cheatsheet.adoc[] |
| 53 | +include::chapters/chapter3.adoc[] |
187 | 54 |
|
188 | | -:leveloffset: -1 |
| 55 | +include::chapters/action.adoc[] |
189 | 56 |
|
190 | | -// |
191 | | -// end chapters |
192 | | -// |
| 57 | +include::chapters/about.adoc[] |
193 | 58 |
|
194 | | -include::chapters/epigraph.adoc[] |
| 59 | +//ifdef::backend-pdf,backend-docbook[] |
| 60 | +//[index] |
| 61 | +//== Index |
| 62 | +//endif::[]s |
0 commit comments