Skip to content

Better docs #18

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 7 commits into from
Jun 17, 2019
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion LICENSE
Original file line number Diff line number Diff line change
@@ -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
Expand Down
470 changes: 394 additions & 76 deletions README.md

Large diffs are not rendered by default.

8 changes: 4 additions & 4 deletions book/book-o.adoc
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down
2 changes: 1 addition & 1 deletion book/chapters/cheatsheet.adoc
Original file line number Diff line number Diff line change
Expand Up @@ -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/
Expand Down
4 changes: 2 additions & 2 deletions book/chapters/divide-and-conquer.adoc
Original file line number Diff line number Diff line change
@@ -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
6 changes: 3 additions & 3 deletions book/chapters/dynamic-programming.adoc
Original file line number Diff line number Diff line change
Expand Up @@ -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
4 changes: 2 additions & 2 deletions book/chapters/greedy-algorithms.adoc
Original file line number Diff line number Diff line change
@@ -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
8 changes: 4 additions & 4 deletions book/chapters/part3.adoc
Original file line number Diff line number Diff line change
Expand Up @@ -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

Expand Down
2 changes: 1 addition & 1 deletion book/chapters/part4.adoc
Original file line number Diff line number Diff line change
Expand Up @@ -34,7 +34,7 @@ include::merge-sort.adoc[]
include::quick-sort.adoc[]

<<<
include::sorting--summary.adoc[]
include::sorting-summary.adoc[]

:leveloffset: -1

Expand Down
File renamed without changes.
File renamed without changes.
Original file line number Diff line number Diff line change
Expand Up @@ -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
2 changes: 1 addition & 1 deletion deprecated-README.adoc
Original file line number Diff line number Diff line change
Expand Up @@ -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.
Expand Down
Loading