|
6 | 6 |
|
7 | 7 | > This is the coding implementations of the [DSA.js book](https://books.adrianmejia.com/dsajs-data-structures-algorithms-javascript/) and the repo for the [npm package](https://www.npmjs.com/package/dsa.js). |
8 | 8 | |
9 | | -> In this repository, you can find classical algorithms and data structuresimplemented and explained in JavaScript. It can be used as a reference manual where developerscan refresh specific topics before an interview or looking for ideas to solve a problem more optimally. |
| 9 | +> In this repository, you can find the implementation of algorithms and data structures. They are implemented and explained in JavaScript. This material can be used as a reference manual for developers. You can refresh specific topics before an interview. Also, you can find ideas to solve problems more efficiently. |
10 | 10 | |
11 | 11 | <!-- (Check out the Time Complexity Cheatsheet) --> |
12 | 12 |
|
@@ -154,7 +154,7 @@ they take different time to complete. |
154 | 154 |
|
155 | 155 | #### Most common time complexities |
156 | 156 |
|
157 | | - |
| 157 | +[](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/chapters/big-o-examples.adoc#summary) |
158 | 158 |
|
159 | 159 | <!-- - Constant time: _O(1)_ |
160 | 160 | - Logarithmic time: _O(log n)_ |
|
0 commit comments