@@ -19,10 +19,6 @@ _Read this in other languages:_
19
19
[ _ Español_ ] ( README.es-ES.md ) ,
20
20
[ _ Português_ ] ( README.pt-BR.md )
21
21
22
- > We’re writing a book that will clearly explain, in detail, the main algorithms.
23
- If you’d like to be notified when the "JavaScript Algorithms" book
24
- launches, [ click here] ( https://upscri.be/402324/ ) .
25
-
26
22
## Data Structures
27
23
28
24
A data structure is a particular way of organizing and storing data in a computer so that it can
@@ -291,3 +287,9 @@ Below is the list of some of the most used Big O notations and their performance
291
287
| ** Shell sort** | n  ; log(n) | depends on gap sequence | n  ; (log(n))<sup >2</sup > | 1 | No | |
292
288
| ** Counting sort** | n + r | n + r | n + r | n + r | Yes | r - biggest number in array |
293
289
| ** Radix sort** | n * k | n * k | n * k | n + k | Yes | k - length of longest key |
290
+
291
+ ## The Book
292
+
293
+ We’re writing a book that will clearly explain, in detail, the main algorithms.
294
+ If you’d like to be notified when the "JavaScript Algorithms" book
295
+ launches, [ click here] ( https://upscri.be/402324/ ) .
0 commit comments