You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: book/chapters/preface.adoc
+10-10Lines changed: 10 additions & 10 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -3,28 +3,28 @@
3
3
4
4
== What is in this book?
5
5
6
-
_{book-title}_ is a book that can be read from cover to cover, where each section builds on top of the previous one. Also, it can be used as a reference manual where developers can refresh certain topics before an interview or looking for ideas to solve a problem optimally. (Cheat sheet summarizing all time complexities and implementations can be found in the <<Time Complexity Cheatsheet, appendix>>)
6
+
_{book-title}_ is a book that can be read from cover to cover, where each section builds on top of the previous one. Also, it can be used as a reference manual where developers can refresh specific topics before an interview or looking for ideas to solve a problem optimally. (Check out the <<Time Complexity Cheatsheet>> and <<Index, topical index>>)
7
7
8
-
This publication is designed to be concise, intending to serve software developers looking to get a firm conceptual understanding of data structures in a quick yet in-depth fashion. After reading this book, the reader should have a fundamental understanding of algorithms, including when and where to apply it, what are the trade-offs of using one data structure over the other. The reader will then be able to make intelligent decisions about algorithms and data structures in their projects require.
8
+
This publication is designed to be concise, intending to serve software developers looking to get a firm conceptual understanding of data structures in a quick yet in-depth fashion. After reading this book, the reader should have a fundamental knowledge of algorithms, including when and where to apply it, what are the trade-offs of using one data structure over the other. The reader will then be able to make intelligent decisions about algorithms and data structures in their projects require.
9
9
10
10
== Who this book is for
11
11
12
12
This book is for software developers familiar with JavaScript looking to improve their problem-solving skills or preparing for a job interview.
13
13
14
-
_NOTE: The concepts in this book can be applied to any programming language. However, instead of doing examples on pseudo-code we are going to use JavaScript to implement the examples._
14
+
NOTE: You can apply the concepts in this book to any programming language. However, instead of doing examples on pseudo-code we are going to use JavaScript to implement the code examples.
15
15
16
16
== What you need for this book
17
17
18
-
You will need Node.js. The book code was tested against Node.js v10.12, but newer versions should also work.
18
+
You will need Node.js. The book code was tested against Node.js v10.15, but newer versions should also work.
19
19
20
20
== Conventions
21
21
22
-
We use a number of typographical conventions within this book that distinguish between different kinds of information.
22
+
We use some typographical conventions within this book that distinguish between different kinds of information.
23
23
24
-
Code in the text, including commands, variables, file names, CSS class names, and property names are shown as follows:
24
+
The code in the text, including commands, variables, file names, CSS class names, and property names are shown as follows:
25
25
26
26
[example]
27
-
The `edgeDirection` parameter allow us to use one class for both undirected and directed graphs.
27
+
Repeat pair comparison until the last element that has been bubbled up to the right side `array.length - i`.
28
28
29
29
A block of code is set out as follows. It may be colored, depending on the format in which you're reading this book.
0 commit comments