Skip to content

Remove intro parts #21

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.

Sign up for GitHub

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

Closed
wants to merge 2 commits into from
Closed

Remove intro parts #21

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
4447083
docs(book): remove duplicated tags
amejiarosario Jun 18, 2019
79a0e61
docs(book): fix html output
amejiarosario Jun 18, 2019
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
1 change: 0 additions & 1 deletion book/chapters/colophon.adoc
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,3 @@
[colophon#colophon%nonfacing]
= {doctitle}

Copyright © {docyear} Adrian Mejia
Expand Down
1 change: 0 additions & 1 deletion book/chapters/dedication.adoc
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,3 @@
[dedication]
= Dedication

To my wife Nathalie that supported me in my long hours of writing and my baby girl Abigail.
Expand Down
6 changes: 3 additions & 3 deletions book/chapters/linear-data-structures-intro.adoc
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
[partintro]
--
// [partintro]
// --
Data Structures comes in many flavors. There’s no one to rule them all. You have to know the tradeoffs so you can choose the right one for the job.

Even though in your day-to-day, you might not need to re-implementing them, knowing how they work internally would help you how when to use over the other or even tweak them to create a new one. We are going to explore the most common data structures time and space complexity.
Expand All @@ -21,4 +21,4 @@ If you want to have a general overview of each one, take a look at the following
+++
endif::[]

--
// --
6 changes: 3 additions & 3 deletions book/chapters/non-linear-data-structures-intro.adoc
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
[partintro]
--
// [partintro]
// --
Non-Linear data structures are everywhere whether you realize it or not. You can find them in databases, Web (HTML DOM tree), search algorithms, finding the best route to get home and many more uses. We are going to learn the basic concepts and when to choose one over the other.

.In this chapter we are going to learn:
Expand All @@ -9,4 +9,4 @@ Non-Linear data structures are everywhere whether you realize it or not. You can
- Keeping dups out with a <>.

By the end of this section, you will know the data structures trade-offs and when to use one over the other.
--
// --
4 changes: 0 additions & 4 deletions book/chapters/part1.adoc
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,11 +1,7 @@
[[chapter-1]]
= Algorithms Analysis

[partintro]
--
In this part, we are going to cover the basics of algorithms analysis. Also, we will discuss the most common runtimes of algorithms and provide a code example for each one.
--


:leveloffset: +1

Expand Down
1 change: 0 additions & 1 deletion book/chapters/preface.adoc
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,3 @@
[preface]
= Preface

== What is in this book?
Expand Down