pdf is 182 pages now

Author: amejiarosario

book-pro/content/part04/sorting-algorithms.asc

@@ -98,11 +98,12 @@ include::insertion-sort.asc[]
 include::selection-sort.asc[]
 
 <<<
-include::quick-sort.asc[]
+include::merge-sort.asc[]
 
 <<<
-include::merge-sort.asc[]
+include::quick-sort.asc[]
 
+<<<
 ==== Summary
 
 We explored many algorithms some of them simple and other more performant. Also, we cover the properties of sorting algorithms such as stable, in-place, online and adaptive.

book-pro/part02-linear-data-structures.asc

@@ -1,4 +1,3 @@
-[[chapter-2]]
 [[part02-linear-data-structures]]
 == Linear Data Structures
 

book-pro/part03-graph-data-structures.asc

@@ -1,4 +1,3 @@
-[[chapter-3]]
 [[part03-graph-data-structures]]
 == Graph Data Structures
 

book-pro/part04-algorithmic-toolbox.asc

@@ -1,4 +1,3 @@
-[[chapter-4]]
 [[part04-algorithmic-toolbox]]
 == Algorithmic Toolbox
 
@@ -23,16 +22,18 @@ Later, you are going to learn some algorithmic paradigms that will help you to i
 
 include::content/part04/sorting-algorithms.asc[]
 
+<<<
 include::content/part04/divide-and-conquer.asc[]
 
+<<<
 include::content/part04/dynamic-programming.asc[]
 
+<<<
 include::content/part04/greedy-algorithms.asc[]
 
+<<<
 include::content/part04/backtracking.asc[]
 
+<<<
 include::content/part04/algorithmic-toolbox.asc[]
 
-=== Summary
-
-Do nisi reprehenderit ea sit pariatur anim aliquip. Adipisicing commodo labore deserunt laboris ad enim. In consectetur aliqua duis dolor. Fugiat cupidatat proident in quis. Reprehenderit commodo est laboris anim sunt. Magna non est aliqua fugiat commodo adipisicing qui pariatur eiusmod. Consectetur do incididunt Lorem id adipisicing enim laboris consectetur voluptate ut.