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 35ddcc5

Browse files
part four working!
1 parent f99bfe9 commit 35ddcc5

File tree

6 files changed

+113
-6
lines changed

6 files changed

+113
-6
lines changed

‎book/book-o.adoc‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -126,7 +126,7 @@ include::chapters/graph-search.adoc[]
126126
127127
:leveloffset: -1
128128
129-
= Algorithms
129+
= Algorithmic Techniques
130130
131131
// TODO: pending
132132
include::chapters/algorithms-intro.adoc[]

‎book/book.adoc‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -52,6 +52,8 @@ include::chapters/chapter2.adoc[]
5252

5353
include::chapters/chapter3.adoc[]
5454

55+
include::chapters/chapter4.adoc[]
56+
5557
include::chapters/action.adoc[]
5658

5759
include::chapters/about.adoc[]

‎book/chapters/chapter3.adoc‎

Lines changed: 56 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,2 +1,57 @@
11
[[chapter-3]]
2-
= Chapter 3
2+
= Non-Linear Data Structures
3+
4+
// (g)
5+
include::non-linear-data-structures-intro.adoc[]
6+
7+
:leveloffset: +1
8+
9+
// (g)
10+
include::tree.adoc[]
11+
12+
13+
// (g)
14+
include::tree--binary-search-tree.adoc[]
15+
16+
include::tree--search.adoc[]
17+
18+
include::tree--self-balancing-rotations.adoc[]
19+
20+
:leveloffset: +1
21+
22+
include::tree--avl.adoc[]
23+
24+
:leveloffset: -1
25+
26+
// (g)
27+
// include::map.adoc[]
28+
include::map-intro.adoc[]
29+
30+
:leveloffset: +1
31+
32+
// (g)
33+
include::map-hashmap.adoc[]
34+
35+
// (g)
36+
include::map-treemap.adoc[]
37+
38+
// (g)
39+
include::map-hashmap-vs-treemap.adoc[]
40+
41+
:leveloffset: -1
42+
43+
// (g)
44+
include::set.adoc[]
45+
46+
// (g)
47+
include::graph.adoc[]
48+
49+
// TODO: pending
50+
include::graph-search.adoc[]
51+
52+
// Graph summary
53+
= Summary
54+
55+
In this section, we learned about Graphs applications, properties and how we can implement them. We mention that you can represent a graph as a matrix or as a list of adjacencies. We went for implementing the later since it's more space efficient. We cover the basic graph operations like adding and removing nodes and edges. In the algorithms section, we are going to cover searching values in the graph.
56+
57+
:leveloffset: -1

‎book/chapters/chapter4.adoc‎

Lines changed: 50 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,50 @@
1+
[[chapter-4]]
2+
= Algorithmic Techniques
3+
4+
// TODO: pending
5+
include::algorithms-intro.adoc[]
6+
7+
:leveloffset: +1
8+
9+
//
10+
// Sorting algorithms
11+
//
12+
= Sorting Algorithms
13+
14+
:leveloffset: +1
15+
16+
// TODO: pending
17+
include::sorting-intro.adoc[]
18+
19+
// Slow Sorting
20+
21+
include::insertion-sort.adoc[]
22+
23+
include::selection-sort.adoc[]
24+
25+
include::bubble-sort.adoc[]
26+
27+
// Fast Sorting
28+
29+
include::merge-sort.adoc[]
30+
31+
include::quick-sort.adoc[]
32+
33+
:leveloffset: -1
34+
35+
36+
//
37+
// Algorithms Techniques
38+
//
39+
40+
include::divide-and-conquer.adoc[]
41+
42+
include::dynamic-programming.adoc[]
43+
44+
include::greedy-algorithms.adoc[]
45+
46+
include::backtracking.adoc[]
47+
48+
// --- end algorithms ---
49+
50+
:leveloffset: -1

‎book/chapters/graph.adoc‎

Lines changed: 0 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -291,7 +291,3 @@ include::{codedir}/data-structures/graphs/node.js[tag=removeAdjacent, indent=0]
291291
|===
292292

293293
As you can see using a `HashSet` on for the adjacency list make a performance improvement.
294-
295-
= Summary
296-
297-
In this section, we learned about Graphs applications, properties and how we can implement them. We mention that you can represent a graph as a matrix or as a list of adjacencies. We went for implementing the later since it's more space efficient. We cover the basic graph operations like adding and removing nodes and edges. In the algorithms section, we are going to cover searching values in the graph.

‎book/extensions/asciidoctor-pdf-extensions.rb‎

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -68,6 +68,10 @@ def layout_chapter_title node, title, opts = {}
6868
part_number = 'TWO'
6969
elsif sect_id.include? 'chapter-3'
7070
part_number = 'THREE'
71+
elsif sect_id.include? 'chapter-4'
72+
part_number = 'FOUR'
73+
elsif sect_id.include? 'chapter-5'
74+
part_number = 'FIVE'
7175
end
7276
if @ppbook
7377
layout_heading part_number, align: :right, size: 100, style: :bold

0 commit comments

Comments
(0)

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