Skip to content

Commit 8415302

Browse files
authoredJun 17, 2019
Merge pull request amejiarosario#18 from amejiarosario/better-docs
Better docs

28 files changed

+432
-1826
lines changed
 

‎LICENSE

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
MIT License
22

3-
Copyright (c) 2016 Adrian Mejia
3+
Copyright (c) 2019 Adrian Mejia
44

55
Permission is hereby granted, free of charge, to any person obtaining a copy
66
of this software and associated documentation files (the "Software"), to deal

‎README.md

Lines changed: 394 additions & 76 deletions
Large diffs are not rendered by default.

‎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/

‎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

‎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

‎book/chapters/greedy-algorithms.adoc

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

3-
include::greedy-algorithms--intro.adoc[]
3+
include::greedy-algorithms-intro.adoc[]
44

55
:leveloffset: +1
66

7-
include::greedy-algorithms--knapsack-problem.adoc[]
7+
include::greedy-algorithms-knapsack-problem.adoc[]
88

99
:leveloffset: -1

‎book/chapters/part3.adoc

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -12,18 +12,18 @@ include::tree.adoc[]
1212

1313
// (g)
1414
<<<
15-
include::tree--binary-search-tree.adoc[]
15+
include::tree-binary-search-tree.adoc[]
1616

1717
<<<
18-
include::tree--search.adoc[]
18+
include::tree-search.adoc[]
1919

2020
<<<
21-
include::tree--self-balancing-rotations.adoc[]
21+
include::tree-self-balancing-rotations.adoc[]
2222

2323
:leveloffset: +1
2424

2525
<<<
26-
include::tree--avl.adoc[]
26+
include::tree-avl.adoc[]
2727

2828
:leveloffset: -1
2929

‎book/chapters/part4.adoc

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -34,7 +34,7 @@ include::merge-sort.adoc[]
3434
include::quick-sort.adoc[]
3535

3636
<<<
37-
include::sorting--summary.adoc[]
37+
include::sorting-summary.adoc[]
3838

3939
:leveloffset: -1
4040

File renamed without changes.

‎book/chapters/tree--search.adoc renamed to ‎book/chapters/tree-search.adoc

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -122,6 +122,6 @@ As you can see the DFS in two iterations is already at one of the farthest nodes
122122

123123
:leveloffset: +1
124124
<<<
125-
include::tree--binary-tree-traversal.adoc[]
125+
include::tree-binary-tree-traversal.adoc[]
126126

127127
:leveloffset: -1

‎deprecated-README.adoc

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -18,7 +18,7 @@ toc::[]
1818
- Algorithm analysis fundamentals (Big O notation, Time/Space complexity) and examples.
1919
- Time/space complexity cheatsheet.
2020
21-
image:book/cover.png[link=https://books.adrianmejia.com, height=400]
21+
image:book/cover.png[link=https://books.adrianmejia.com/dsajs-data-structures-algorithms-javascript/, height=400]
2222

2323
== Data Structures
2424
We are covering the following data structures.

‎docs/kumu-adriansky-data-structures-algorithms-java.json

Lines changed: 0 additions & 826 deletions
This file was deleted.
Binary file not shown.

‎docs/kumu-adriansky-data-structures-algorithms.json

Lines changed: 0 additions & 904 deletions
This file was deleted.
Binary file not shown.

‎notes.md

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -33,6 +33,24 @@ New features in this release
3333
git log <last release> HEAD --grep feat
3434
```
3535

36+
# Generate TOC
37+
38+
Install
39+
```
40+
npm install -g doctoc
41+
```
42+
43+
Add to *.md:
44+
```
45+
<!-- START doctoc -->
46+
<!-- END doctoc -->
47+
```
48+
49+
Run:
50+
```
51+
doctoc README.md
52+
```
53+
3654

3755
# Roadmap
3856
- [x] PDF: callouts and emojis are not showing correctly

0 commit comments

Comments
 (0)
Please sign in to comment.