@@ -19,7 +19,7 @@ _Read this in other languages:_
1919[ _ Español_ ] ( README.es-ES.md ) ,
2020[ _ Português_ ] ( README.pt-BR.md )
2121
22- * Note that this project is meant to be used for learning and researching purposes
22+ * ☝ Note that this project is meant to be used for learning and researching purposes
2323only and it is** not** meant to be used for production.*
2424
2525##Data Structures
@@ -296,9 +296,3 @@ Below is the list of some of the most used Big O notations and their performance
296296| ** Shell sort** | n  ; log(n)| depends on gap sequence| n  ; (log(n))<sup >2</sup >| 1| No| |
297297| ** Counting sort** | n + r| n + r| n + r| n + r| Yes| r - biggest number in array|
298298| ** Radix sort** | n * k| n * k| n * k| n + k| Yes| k - length of longest key|
299-
300- ##The Book
301-
302- We’re writing a book that will clearly explain, in detail, the main algorithms.
303- If you’d like to be notified when the “JavaScript Algorithms” book
304- launches,[ click here] ( https://upscri.be/402324/ ) .