fix cheatsheet

Author: amejiarosario

book-pro/A-time-complexity-cheatsheet.asc

@@ -1,30 +1,30 @@
 [[time-complexity-cheatsheet]]
 [appendix]
-== Time Complexity Cheatsheet
+== Cheatsheet
 
 This section summerize what we are  going to cover in the rest of this book.
 
-// === Runtimes
+=== Runtimes
 
-// include::big-o-examples.adoc[tag=table]
+include::content/part01/big-o-examples.asc[tag=table]
 
-// include::algorithms-analysis.adoc[tag=table]
+include::content/part01/algorithms-analysis.asc[tag=table]
 
-// === Linear Data Structures
+=== Linear Data Structures
 
-// include::linear-data-structures-outro.adoc[tag=table]
+include::part02-linear-data-structures.asc[tag=table]
 
-// === Trees and Maps Data Structures
+=== Trees and Maps Data Structures
 
-// This section covers Binary Search Tree (BST) time complexity (Big O).
+This section covers Binary Search Tree (BST) time complexity (Big O).
 
-// include::part3.adoc[tag=table]
+include::part03-graph-data-structures.asc[tag=table]
 
-// include::graph.adoc[tag=table]
+include::content/part03/graph.asc[tag=table]
 
-// === Sorting Algorithms
+=== Sorting Algorithms
 
-// include::sorting-summary.adoc[tag=table]
+include::content/part04/sorting-algorithms.asc[tag=table]
 
 // // https://algs4.cs.princeton.edu/cheatsheet/
 // // http://bigocheatsheet.com/