Merge pull request #18 from amejiarosario/better-docs

Better docs

Author: amejiarosario

LICENSE

@@ -1,6 +1,6 @@
 MIT License
 
-Copyright (c) 2016 Adrian Mejia
+Copyright (c) 2019 Adrian Mejia
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal

README.md

@@ -86,15 +86,15 @@ include::chapters/tree.adoc[]
 
 
 // (g)
-include::chapters/tree--binary-search-tree.adoc[]
+include::chapters/tree-binary-search-tree.adoc[]
 
-include::chapters/tree--search.adoc[]
+include::chapters/tree-search.adoc[]
 
-include::chapters/tree--self-balancing-rotations.adoc[]
+include::chapters/tree-self-balancing-rotations.adoc[]
 
 :leveloffset: +1
 
-include::chapters/tree--avl.adoc[]
+include::chapters/tree-avl.adoc[]
 
 :leveloffset: -1
 

book/book-o.adoc

@@ -23,7 +23,7 @@ include::graph.adoc[tag=table]
 
 == Sorting Algorithms
 
-include::sorting--summary.adoc[tag=table]
+include::sorting-summary.adoc[tag=table]
 
 // https://algs4.cs.princeton.edu/cheatsheet/
 // http://bigocheatsheet.com/

book/chapters/cheatsheet.adoc

@@ -1,9 +1,9 @@
 = Divide and Conquer
 
-include::divide-and-conquer--intro.adoc[]
+include::divide-and-conquer-intro.adoc[]
 
 :leveloffset: +1
 
-include::divide-and-conquer--fibonacci.adoc[]
+include::divide-and-conquer-fibonacci.adoc[]
 
 :leveloffset: -1

book/chapters/divide-and-conquer--fibonacci.adoc renamed to book/chapters/divide-and-conquer-fibonacci.adoc

@@ -5,12 +5,12 @@ endif::[]
 
 = Dynamic Programming
 
-include::dynamic-programming--intro.adoc[]
+include::dynamic-programming-intro.adoc[]
 
 :leveloffset: +1
 
-include::dynamic-programming--fibonacci.adoc[]
+include::dynamic-programming-fibonacci.adoc[]
 
-// include::chapters/dynamic-programming--knapsack-problem.adoc[]
+// include::chapters/dynamic-programming-knapsack-problem.adoc[]
 
 :leveloffset: -1

book/chapters/divide-and-conquer--intro.adoc renamed to book/chapters/divide-and-conquer-intro.adoc

@@ -1,9 +1,9 @@
 = Greedy Algorithms
 
-include::greedy-algorithms--intro.adoc[]
+include::greedy-algorithms-intro.adoc[]
 
 :leveloffset: +1
 
-include::greedy-algorithms--knapsack-problem.adoc[]
+include::greedy-algorithms-knapsack-problem.adoc[]
 
 :leveloffset: -1

book/chapters/divide-and-conquer.adoc

@@ -12,18 +12,18 @@ include::tree.adoc[]
 
 // (g)
 <<<
-include::tree--binary-search-tree.adoc[]
+include::tree-binary-search-tree.adoc[]
 
 <<<
-include::tree--search.adoc[]
+include::tree-search.adoc[]
 
 <<<
-include::tree--self-balancing-rotations.adoc[]
+include::tree-self-balancing-rotations.adoc[]
 
 :leveloffset: +1
 
 <<<
-include::tree--avl.adoc[]
+include::tree-avl.adoc[]
 
 :leveloffset: -1
 

book/chapters/dynamic-programming--fibonacci.adoc renamed to book/chapters/dynamic-programming-fibonacci.adoc

@@ -34,7 +34,7 @@ include::merge-sort.adoc[]
 include::quick-sort.adoc[]
 
 <<<
-include::sorting--summary.adoc[]
+include::sorting-summary.adoc[]
 
 :leveloffset: -1
 

book/chapters/dynamic-programming--intro.adoc renamed to book/chapters/dynamic-programming-intro.adoc

@@ -122,6 +122,6 @@ As you can see the DFS in two iterations is already at one of the farthest nodes
 
 :leveloffset: +1
 <<<
-include::tree--binary-tree-traversal.adoc[]
+include::tree-binary-tree-traversal.adoc[]
 
 :leveloffset: -1

book/chapters/dynamic-programming--knapsack-problem.adoc renamed to book/chapters/dynamic-programming-knapsack-problem.adoc

@@ -18,7 +18,7 @@ toc::[]
 - Algorithm analysis fundamentals (Big O notation, Time/Space complexity) and examples.
 - Time/space complexity cheatsheet.
 
-image:book/cover.png[link=https://books.adrianmejia.com, height=400]
+image:book/cover.png[link=https://books.adrianmejia.com/dsajs-data-structures-algorithms-javascript/, height=400]
 
 == Data Structures
 We are covering the following data structures.