Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 277af2f

Browse files
docs: change file names to avoid broken links in github
1 parent 53e903e commit 277af2f

21 files changed

+24
-24
lines changed

‎README.md

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -335,15 +335,15 @@ Learn all the different kinds of trees and its properties.
335335
nodes value keep this order `left < parent < right`.
336336
[Code](https://github.com/amejiarosario/algorithms.js/blob/master/src/data-structures/trees/binary-search-tree.js)
337337
|
338-
[BST Time complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/tree--binary-search-tree.adoc#tree-complexity)
338+
[BST Time complexity](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/tree-binary-search-tree.adoc#tree-complexity)
339339
<!-- [Post](https://adrianmejia.com/blog/2018/06/11/data-structures-for-beginners-trees-binary-search-tree-tutorial/#Binary-Search-Tree-BST) -->
340340

341341
- **AVL Trees**: Self-balanced BST to maximize look up time.
342342
[Code](https://github.com/amejiarosario/algorithms.js/blob/master/src/data-structures/trees/avl-tree.js)
343343
|
344-
[AVL Tree docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/tree--avl.adoc)
344+
[AVL Tree docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/tree-avl.adoc)
345345
|
346-
[Self-balancing & tree rotations docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/tree--self-balancing-rotations.adoc)
346+
[Self-balancing & tree rotations docs](https://github.com/amejiarosario/dsa.js/blob/master/book/chapters/tree-self-balancing-rotations.adoc)
347347
<!-- [Post](https://adrianmejia.com/blog/2018/07/16/self-balanced-binary-search-trees-with-avl-tree-data-structure-for-beginners/) -->
348348

349349
- **Red-Black Trees**: Self-balanced BST more loose than AVL to
@@ -385,9 +385,9 @@ From unbalanced BST to balanced BST
385385

386386
### ⚒ [Algorithms Techniques](https://github.com/amejiarosario/dsa.js-data-structures-and-algorithms-in-javascript/blob/master/book/chapters/part4.adoc)
387387

388-
-Never get stuck solving a problem with 7 simple steps.
389-
-Master the most popular sorting algorithms (mergesort, quicksort, insertion sort, ...)
390-
-Learn different approaches to solve problems such as divide and conquer, dynamic programming, greedy algorithms, and backtracking.
388+
<!-- - Never get stuck solving a problem with 7 simple steps.-->
389+
<!-- - Master the most popular sorting algorithms (mergesort, quicksort, insertion sort, ...)-->
390+
<!-- - Learn different approaches to solve problems such as divide and conquer, dynamic programming, greedy algorithms, and backtracking.-->
391391

392392
<blockquote>
393393
<details>

‎book/book-o.adoc

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -86,15 +86,15 @@ include::chapters/tree.adoc[]
8686
8787
8888
// (g)
89-
include::chapters/tree--binary-search-tree.adoc[]
89+
include::chapters/tree-binary-search-tree.adoc[]
9090
91-
include::chapters/tree--search.adoc[]
91+
include::chapters/tree-search.adoc[]
9292
93-
include::chapters/tree--self-balancing-rotations.adoc[]
93+
include::chapters/tree-self-balancing-rotations.adoc[]
9494
9595
:leveloffset: +1
9696
97-
include::chapters/tree--avl.adoc[]
97+
include::chapters/tree-avl.adoc[]
9898
9999
:leveloffset: -1
100100

‎book/chapters/cheatsheet.adoc

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -23,7 +23,7 @@ include::graph.adoc[tag=table]
2323

2424
== Sorting Algorithms
2525

26-
include::sorting--summary.adoc[tag=table]
26+
include::sorting-summary.adoc[tag=table]
2727

2828
// https://algs4.cs.princeton.edu/cheatsheet/
2929
// http://bigocheatsheet.com/
File renamed without changes.
File renamed without changes.

‎book/chapters/divide-and-conquer.adoc

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,9 @@
11
= Divide and Conquer
22

3-
include::divide-and-conquer--intro.adoc[]
3+
include::divide-and-conquer-intro.adoc[]
44

55
:leveloffset: +1
66

7-
include::divide-and-conquer--fibonacci.adoc[]
7+
include::divide-and-conquer-fibonacci.adoc[]
88

99
:leveloffset: -1
File renamed without changes.
File renamed without changes.
File renamed without changes.

‎book/chapters/dynamic-programming.adoc

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -5,12 +5,12 @@ endif::[]
55

66
= Dynamic Programming
77

8-
include::dynamic-programming--intro.adoc[]
8+
include::dynamic-programming-intro.adoc[]
99

1010
:leveloffset: +1
1111

12-
include::dynamic-programming--fibonacci.adoc[]
12+
include::dynamic-programming-fibonacci.adoc[]
1313

14-
// include::chapters/dynamic-programming--knapsack-problem.adoc[]
14+
// include::chapters/dynamic-programming-knapsack-problem.adoc[]
1515

1616
:leveloffset: -1

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /