Skip to content

Commit df281eb

Browse files
committedJun 28, 2019
docs(readme): make links relative
1 parent f592ff8 commit df281eb

File tree

1 file changed

+73
-73
lines changed

1 file changed

+73
-73
lines changed
 

‎README.md

Lines changed: 73 additions & 73 deletions
Original file line numberDiff line numberDiff line change
@@ -65,7 +65,7 @@ and then you can import it into your programs or CLI
6565
const { LinkedList, Queue, Stack } = require('dsa.js');
6666
```
6767

68-
For a full list of all the exposed data structures and algorithms [see](https://github.com/amejiarosario/dsa.js/blob/master/src/index.js).
68+
For a full list of all the exposed data structures and algorithms [see](src/index.js).
6969

7070

7171
## Features
@@ -89,15 +89,15 @@ This material is going to teach you to:
8989

9090
## What's Inside
9191

92-
All the code and explanations are available on this repo. You can dig through the links and code examples from the ([src folder](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/tree/master/src)). However, the inline code examples are not expanded (because of Github's asciidoc limitations) but you can follow the path and see the implementation.
92+
All the code and explanations are available on this repo. You can dig through the links and code examples from the ([src folder](src)). However, the inline code examples are not expanded (because of Github's asciidoc limitations) but you can follow the path and see the implementation.
9393

9494
_Note: If you prefer to consume the information in a more linear fashion then the [book format](https://books.adrianmejia.com/dsajs-data-structures-algorithms-javascript/) would be more appropriate for you._
9595

9696
The topics are divided in 4 main categories as you can see below:
9797

9898
_(You can click on the ⯈ to expand the topics)_
9999

100-
### 📈 [Algorithms Analysis](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/part01-algorithms-analysis.asc)
100+
### 📈 [Algorithms Analysis](book/part01-algorithms-analysis.asc)
101101

102102
<!-- - Computer Science nuggets without all the mumbo-jumbo.
103103
- Learn how to compare algorithms using Big O notation.
@@ -112,11 +112,11 @@ _(You can click on the ⯈ to expand the topics)_
112112

113113
---
114114

115-
### [Computer Science nuggets without all the mumbo-jumbo](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part01/algorithms-analysis.asc)
115+
### [Computer Science nuggets without all the mumbo-jumbo](book/content/part01/algorithms-analysis.asc)
116116

117117
#### Learn to calculate run time from code examples
118118

119-
![Translating lines of code to an approximate number of operations](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/raw/master/book/images/image4.png)
119+
![Translating lines of code to an approximate number of operations](book/images/image4.png)
120120

121121
---
122122

@@ -129,16 +129,16 @@ _(You can click on the ⯈ to expand the topics)_
129129

130130
---
131131

132-
### [Learn how to compare algorithms using Big O notation.](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part01/big-o-examples.asc#finding-if-an-array-is-empty)
132+
### [Learn how to compare algorithms using Big O notation.](book/content/part01/big-o-examples.asc#finding-if-an-array-is-empty)
133133

134134
#### Comparing algorithms using Big O notation
135135

136136
Let's say you want to find the duplicates on an array.
137137
Using Big O notation we can compare different implementations that do exactly the same but
138138
they take different time to complete.
139139

140-
- [Optimal solution using a map](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part01/big-o-examples.asc#linear-example)
141-
- [Finding duplicates in an array (naïve approach)](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part01/big-o-examples.asc#quadratic-example)
140+
- [Optimal solution using a map](book/content/part01/big-o-examples.asc#linear-example)
141+
- [Finding duplicates in an array (naïve approach)](book/content/part01/big-o-examples.asc#quadratic-example)
142142

143143
---
144144

@@ -151,11 +151,11 @@ they take different time to complete.
151151

152152
---
153153

154-
[8 examples to explain with code how to calculate time complexity](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part01/big-o-examples.asc#summary)
154+
[8 examples to explain with code how to calculate time complexity](book/content/part01/big-o-examples.asc#summary)
155155

156156
#### Most common time complexities
157157

158-
[![image](https://user-images.githubusercontent.com/418605/59617342-2a715080-90f4-11e9-9de9-9315fb0133f9.png)](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part01/big-o-examples.asc#summary)
158+
[![image](https://user-images.githubusercontent.com/418605/59617342-2a715080-90f4-11e9-9de9-9315fb0133f9.png)](book/content/part01/big-o-examples.asc#summary)
159159

160160
<!-- - Constant time: _O(1)_
161161
- Logarithmic time: _O(log n)_
@@ -168,14 +168,14 @@ they take different time to complete.
168168

169169
#### Time complexity graph
170170

171-
![Most common time complexities](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/raw/master/book/images/image5.png)
171+
![Most common time complexities](book/images/image5.png)
172172

173173
---
174174

175175
</details>
176176
</blockquote>
177177

178-
### 🥞 [Linear Data Structures](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/part02-linear-data-structures.asc)
178+
### 🥞 [Linear Data Structures](book/part02-linear-data-structures.asc)
179179

180180
<!-- - Understand the ins and outs of the most common data structures.
181181
- When to use an Array or Linked List. Know the tradeoffs.
@@ -190,29 +190,29 @@ they take different time to complete.
190190

191191
---
192192

193-
#### [Understand the ins and outs of the most common data structures](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/part02-linear-data-structures.asc)
193+
#### [Understand the ins and outs of the most common data structures](book/part02-linear-data-structures.asc)
194194

195195

196-
- [Arrays](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part02/array.asc): Built-in in most languages so not implemented here. [Array Time complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/content/part02/array.asc#array-complexity)
196+
- [Arrays](book/content/part02/array.asc): Built-in in most languages so not implemented here. [Array Time complexity](book/content/part02/array.asc#array-complexity)
197197
<!-- [Post](https://adrianmejia.com/blog/2018/04/28/data-structures-time-complexity-for-beginners-arrays-hashmaps-linked-lists-stacks-queues-tutorial/#Array). -->
198198

199-
- [Linked List](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part02/linked-list.asc): each data node has a link to the next (and
199+
- [Linked List](book/content/part02/linked-list.asc): each data node has a link to the next (and
200200
previous).
201-
[Code](https://github.com/amejiarosario/dsa.js/blob/master/src/data-structures/linked-lists/linked-list.js)
201+
[Code](src/data-structures/linked-lists/linked-list.js)
202202
|
203-
[Linked List Time Complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/content/part02/linked-list.asc#linked-list-complexity-vs-array-complexity)
203+
[Linked List Time Complexity](book/content/part02/linked-list.asc#linked-list-complexity-vs-array-complexity)
204204
<!-- [Post](https://adrianmejia.com/blog/2018/04/28/data-structures-time-complexity-for-beginners-arrays-hashmaps-linked-lists-stacks-queues-tutorial/#Linked-Lists) -->
205205

206-
- [Queue](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part02/queue.asc): data flows in a "first-in, first-out" (FIFO) manner.
207-
[Code](https://github.com/amejiarosario/dsa.js/blob/master/src/data-structures/queues/queue.js)
206+
- [Queue](book/content/part02/queue.asc): data flows in a "first-in, first-out" (FIFO) manner.
207+
[Code](src/data-structures/queues/queue.js)
208208
|
209-
[Queue Time Complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/content/part02/queue.asc#queue-complexity)
209+
[Queue Time Complexity](book/content/part02/queue.asc#queue-complexity)
210210
<!-- [Post](https://adrianmejia.com/blog/2018/04/28/data-structures-time-complexity-for-beginners-arrays-hashmaps-linked-lists-stacks-queues-tutorial/#Queues) -->
211211

212-
- [Stack](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part02/stack.asc): data flows in a "last-in, first-out" (LIFO) manner.
213-
[Code](https://github.com/amejiarosario/dsa.js/blob/master/src/data-structures/stacks/stack.js)
212+
- [Stack](book/content/part02/stack.asc): data flows in a "last-in, first-out" (LIFO) manner.
213+
[Code](src/data-structures/stacks/stack.js)
214214
|
215-
[Stack Time Complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/content/part02/stack.asc#stack-complexity)
215+
[Stack Time Complexity](book/content/part02/stack.asc#stack-complexity)
216216
<!-- [Post](https://adrianmejia.com/blog/2018/04/28/data-structures-time-complexity-for-beginners-arrays-hashmaps-linked-lists-stacks-queues-tutorial/#Stacks) -->
217217

218218
---
@@ -225,7 +225,7 @@ they take different time to complete.
225225

226226
---
227227

228-
#### [When to use an Array or Linked List. Know the tradeoffs](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part02/array-vs-list-vs-queue-vs-stack.asc)
228+
#### [When to use an Array or Linked List. Know the tradeoffs](book/content/part02/array-vs-list-vs-queue-vs-stack.asc)
229229

230230
Use Arrays when…
231231
- You need to access data in random order fast (using an index).
@@ -246,19 +246,19 @@ Use Linked Lists when:
246246

247247
---
248248

249-
#### [Build a List, Stack and a Queue from scratch](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/part02-linear-data-structures.asc)
249+
#### [Build a List, Stack and a Queue from scratch](book/part02-linear-data-structures.asc)
250250

251251
Build any of these data structures from scratch:
252-
- [Linked List](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/src/data-structures/linked-lists/linked-list.js)
253-
- [Stack](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/src/data-structures/stacks/stack.js)
254-
- [Queue](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/src/data-structures/queues/queue.js)
252+
- [Linked List](src/data-structures/linked-lists/linked-list.js)
253+
- [Stack](src/data-structures/stacks/stack.js)
254+
- [Queue](src/data-structures/queues/queue.js)
255255

256256
---
257257

258258
</details>
259259
</blockquote>
260260

261-
### 🌲 [Non-Linear Data Structures](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/part03-graph-data-structures.asc)
261+
### 🌲 [Non-Linear Data Structures](book/part03-graph-data-structures.asc)
262262
<!-- - Understand one of the most versatile data structure of all: Maps -->
263263
<!-- - Know the properties of Graphs and Trees. -->
264264
<!-- - Implement a binary search tree for fast lookups. -->
@@ -271,13 +271,13 @@ Use Linked Lists when:
271271

272272
---
273273

274-
#### [HashMaps](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part03/map.asc)
274+
#### [HashMaps](book/content/part03/map.asc)
275275

276276
Learn how to implement different types of Maps such as:
277-
- [HashMap](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part03/hashmap.asc)
278-
- [TreeMap](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part03/treemap.asc)
277+
- [HashMap](book/content/part03/hashmap.asc)
278+
- [TreeMap](book/content/part03/treemap.asc)
279279

280-
Also, [learn the difference between the different Maps implementations](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part03/time-complexity-graph-data-structures.asc):
280+
Also, [learn the difference between the different Maps implementations](book/content/part03/time-complexity-graph-data-structures.asc):
281281

282282
- `HashMap` is more time-efficient. A `TreeMap` is more space-efficient.
283283
- `TreeMap` search complexity is *O(log n)*, while an optimized `HashMap` is *O(1)* on average.
@@ -296,60 +296,60 @@ Also, [learn the difference between the different Maps implementations](https://
296296

297297
---
298298

299-
#### [Know the properties of Graphs and Trees](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/part03-graph-data-structures.asc)
299+
#### [Know the properties of Graphs and Trees](book/part03-graph-data-structures.asc)
300300

301-
##### [Graphs](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part03/graph.asc)
301+
##### [Graphs](book/content/part03/graph.asc)
302302

303303
Know all the graphs properties with many images and illustrations.
304304

305-
![graph example with USA airports](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/raw/master/book/images/image46.png)
305+
![graph example with USA airports](book/images/image46.png)
306306

307307
**Graphs**: data **nodes** that can have a connection or **edge** to
308308
zero or more adjacent nodes. Unlike trees, nodes can have multiple
309309
parents, loops.
310-
[Code](https://github.com/amejiarosario/algorithms.js/blob/master/src/data-structures/graphs/graph.js)
310+
[Code](src/data-structures/graphs/graph.js)
311311
|
312-
[Graph Time Complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/content/part03/graph.asc#graph-complexity)
312+
[Graph Time Complexity](book/content/part03/graph.asc#graph-complexity)
313313

314-
#### [Trees](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part03/tree-intro.asc)
314+
#### [Trees](book/content/part03/tree-intro.asc)
315315

316316
Learn all the different kinds of trees and its properties.
317317

318-
![tree data structure properties](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/raw/master/book/images/image31.jpg)
318+
![tree data structure properties](book/images/image31.jpg)
319319

320320
- **Trees**: data nodes has zero or more adjacent nodes a.k.a.
321321
children. Each node can only have one parent node otherwise is a
322322
graph not a tree.
323-
[Code](https://github.com/amejiarosario/algorithms.js/tree/master/src/data-structures/trees)
323+
[Code](src/data-structures/trees)
324324
|
325-
[Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/content/part03/tree-intro.asc)
325+
[Docs](book/content/part03/tree-intro.asc)
326326
<!-- [Post](https://adrianmejia.com/blog/2018/06/11/data-structures-for-beginners-trees-binary-search-tree-tutorial/) -->
327327

328328
- **Binary Trees**: same as tree but only can have two children at
329329
most.
330-
[Code](https://github.com/amejiarosario/algorithms.js/tree/master/src/data-structures/trees)
330+
[Code](src/data-structures/trees)
331331
|
332-
[Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/content/part03/tree-intro.asc#binary-tree)
332+
[Docs](book/content/part03/tree-intro.asc#binary-tree)
333333
<!-- [Post](https://adrianmejia.com/blog/2018/06/11/data-structures-for-beginners-trees-binary-search-tree-tutorial/#Binary-Trees) -->
334334

335335
- **Binary Search Trees** (BST): same as binary tree, but the
336336
nodes value keep this order `left < parent < right`.
337-
[Code](https://github.com/amejiarosario/algorithms.js/blob/master/src/data-structures/trees/binary-search-tree.js)
337+
[Code](src/data-structures/trees/binary-search-tree.js)
338338
|
339-
[BST Time complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/content/part03/binary-search-tree.asc#tree-complexity)
339+
[BST Time complexity](book/content/part03/binary-search-tree.asc#tree-complexity)
340340
<!-- [Post](https://adrianmejia.com/blog/2018/06/11/data-structures-for-beginners-trees-binary-search-tree-tutorial/#Binary-Search-Tree-BST) -->
341341

342342
- **AVL Trees**: Self-balanced BST to maximize look up time.
343-
[Code](https://github.com/amejiarosario/algorithms.js/blob/master/src/data-structures/trees/avl-tree.js)
343+
[Code](src/data-structures/trees/avl-tree.js)
344344
|
345-
[AVL Tree docs](https://github.com/amejiarosario/dsa.js/blob/master/book/C-AVL-tree.asc)
345+
[AVL Tree docs](book/C-AVL-tree.asc)
346346
|
347-
[Self-balancing & tree rotations docs](https://github.com/amejiarosario/dsa.js/blob/master/book/B-self-balancing-binary-search-trees.asc)
347+
[Self-balancing & tree rotations docs](book/B-self-balancing-binary-search-trees.asc)
348348
<!-- [Post](https://adrianmejia.com/blog/2018/07/16/self-balanced-binary-search-trees-with-avl-tree-data-structure-for-beginners/) -->
349349

350350
- **Red-Black Trees**: Self-balanced BST more loose than AVL to
351351
maximize insertion speed.
352-
[Code](https://github.com/amejiarosario/algorithms.js/blob/master/src/data-structures/trees/red-black-tree.js)
352+
[Code](src/data-structures/trees/red-black-tree.js)
353353

354354
---
355355

@@ -362,12 +362,12 @@ Learn all the different kinds of trees and its properties.
362362

363363
---
364364

365-
#### [Implement a binary search tree for fast lookups](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part03/binary-search-tree.asc)
365+
#### [Implement a binary search tree for fast lookups](book/content/part03/binary-search-tree.asc)
366366

367367
- Learn how to add/remove/update values in a tree:
368-
![inserting node in a tree](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/raw/master/book/images/image36.png)
368+
![inserting node in a tree](book/images/image36.png)
369369

370-
- [How to make a tree balanced?](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/B-self-balancing-binary-search-trees.asc)
370+
- [How to make a tree balanced?](book/B-self-balancing-binary-search-trees.asc)
371371

372372
From unbalanced BST to balanced BST
373373
```
@@ -384,7 +384,7 @@ From unbalanced BST to balanced BST
384384
</details>
385385
</blockquote>
386386

387-
### [Algorithmic Toolbox](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/part04-algorithmic-toolbox.asc)
387+
### [Algorithmic Toolbox](book/part04-algorithmic-toolbox.asc)
388388

389389
<!-- - Never get stuck solving a problem with 7 simple steps. -->
390390
<!-- - Master the most popular sorting algorithms (mergesort, quicksort, insertion sort, ...) -->
@@ -398,7 +398,7 @@ From unbalanced BST to balanced BST
398398

399399
---
400400

401-
#### [Never get stuck solving a problem with 7 simple steps](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/part04-algorithmic-toolbox.asc)
401+
#### [Never get stuck solving a problem with 7 simple steps](book/part04-algorithmic-toolbox.asc)
402402

403403
1. Understand the problem
404404
1. Build a simple example (no edge cases yet)
@@ -408,7 +408,7 @@ From unbalanced BST to balanced BST
408408
1. Write Code, yes, now you can code.
409409
1. Test your written code
410410

411-
Full details [here](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/part04-algorithmic-toolbox.asc)
411+
Full details [here](book/part04-algorithmic-toolbox.asc)
412412

413413
---
414414

@@ -420,34 +420,34 @@ Full details [here](https://github.com/amejiarosario/dsa.js-data-structures-and-
420420

421421
---
422422

423-
#### [Master the most popular sorting algorithms](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part04/sorting-algorithms.asc)
423+
#### [Master the most popular sorting algorithms](book/content/part04/sorting-algorithms.asc)
424424

425425
We are going to explore three basic sorting algorithms O(n2) which have low overhead:
426426
- Bubble Sort.
427-
[Code](https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/sorting/bubble-sort.js)
427+
[Code](src/algorithms/sorting/bubble-sort.js)
428428
|
429-
[Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/content/part04/bubble-sort.asc)
429+
[Docs](book/content/part04/bubble-sort.asc)
430430

431431
- Insertion Sort.
432-
[Code](https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/sorting/insertion-sort.js)
432+
[Code](src/algorithms/sorting/insertion-sort.js)
433433
|
434-
[Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/content/part04/insertion-sort.asc)
434+
[Docs](book/content/part04/insertion-sort.asc)
435435

436436
- Selection Sort.
437-
[Code](https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/sorting/selection-sort.js)
437+
[Code](src/algorithms/sorting/selection-sort.js)
438438
|
439-
[Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/content/part04/selection-sort.asc)
439+
[Docs](book/content/part04/selection-sort.asc)
440440

441441
and then discuss efficient sorting algorithms O(n log n) such as:
442442
- Merge Sort.
443-
[Code](https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/sorting/merge-sort.js)
443+
[Code](src/algorithms/sorting/merge-sort.js)
444444
|
445-
[Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/content/part04/merge-sort.asc)
445+
[Docs](book/content/part04/merge-sort.asc)
446446

447447
- Quick sort.
448-
[Code](https://github.com/amejiarosario/dsa.js/blob/master/src/algorithms/sorting/quick-sort.js)
448+
[Code](src/algorithms/sorting/quick-sort.js)
449449
|
450-
[Docs](https://github.com/amejiarosario/dsa.js/blob/master/book/content/part04/quick-sort.asc)
450+
[Docs](book/content/part04/quick-sort.asc)
451451

452452
---
453453

@@ -459,13 +459,13 @@ and then discuss efficient sorting algorithms O(n log n) such as:
459459

460460
---
461461

462-
#### [Learn different approaches to solve algorithmic problems](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/part04-algorithmic-toolbox.asc)
462+
#### [Learn different approaches to solve algorithmic problems](book/part04-algorithmic-toolbox.asc)
463463

464464
We are going to discuss the following techniques for solving algorithms problems:
465-
- [Greedy Algorithms](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/bbook/content/part04/greedy-algorithms.asc): makes greedy choices using heuristics to find the best solution without looking back.
466-
- [Dynamic Programming](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part04/dynamic-programming.asc): a technique for speeding up recursive algorithms when there are many _overlapping subproblems_. It uses _memoization_ to avoid duplicating work.
467-
- [Divide and Conquer](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part04/divide-and-conquer.asc): _divide_ problems into smaller pieces, _conquer_ each subproblem and then _join_ the results.
468-
- [Backtracking](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/content/part04/backtracking.asc): search _all (or some)_ possible paths. However, it stops and _go back_ as soon as notice the current solution is not working.
465+
- [Greedy Algorithms](book/content/part04/greedy-algorithms.asc): makes greedy choices using heuristics to find the best solution without looking back.
466+
- [Dynamic Programming](book/content/part04/dynamic-programming.asc): a technique for speeding up recursive algorithms when there are many _overlapping subproblems_. It uses _memoization_ to avoid duplicating work.
467+
- [Divide and Conquer](book/content/part04/divide-and-conquer.asc): _divide_ problems into smaller pieces, _conquer_ each subproblem and then _join_ the results.
468+
- [Backtracking](book/content/part04/backtracking.asc): search _all (or some)_ possible paths. However, it stops and _go back_ as soon as notice the current solution is not working.
469469
- _Brute Force_: generate all possible solutions and tries all of them. (Use it as a last resort or as the starting point to optimize it with other techniques).
470470

471471
---
@@ -515,4 +515,4 @@ The best way to support this project is buying the [book](https://books.adrianme
515515

516516
## License
517517

518-
[![License](https://img.shields.io/:license-mit-blue.svg?style=flat-square)](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/LICENSE)
518+
[![License](https://img.shields.io/:license-mit-blue.svg?style=flat-square)](LICENSE)

0 commit comments

Comments
 (0)
Please sign in to comment.