works with PDF!!

Author: amejiarosario

.gitignore

@@ -137,11 +137,11 @@ Desktop.ini
 ######################
 # Gemfile
 # Gemfile.lock
-Makefile
-_conf
-_resources
-extensions
-fonts
+# Makefile
+# _conf
+# _resources
+# extensions
+# fonts
 
 
 ######################

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

@@ -0,0 +1,39 @@
+[[time-complexity-cheatsheet]]
+[appendix]
+== Time Complexity Cheatsheet
+
+This section summerize what we are  going to cover in the rest of this book.
+
+// === Runtimes
+
+// include::big-o-examples.adoc[tag=table]
+
+// include::algorithms-analysis.adoc[tag=table]
+
+// === Linear Data Structures
+
+// include::linear-data-structures-outro.adoc[tag=table]
+
+// === Trees and Maps Data Structures
+
+// This section covers Binary Search Tree (BST) time complexity (Big O).
+
+// include::part3.adoc[tag=table]
+
+// include::graph.adoc[tag=table]
+
+// === Sorting Algorithms
+
+// include::sorting-summary.adoc[tag=table]
+
+// // https://algs4.cs.princeton.edu/cheatsheet/
+// // http://bigocheatsheet.com/
+
+// // https://en.wikipedia.org/wiki/Timsort (Tim Peters)
+// // https://bugs.python.org/file4451/timsort.txt
+// // https://www.youtube.com/watch?v=emeME__917E&list=PLMCXHnjXnTntLcLmA5SqhMspm7burHi3m
+
+// // https://en.wikipedia.org/wiki/Sorting_algorithm
+// // http://sorting.at/
+// // https://www.toptal.com/developers/sorting-algorithms
+// // https://www.infopulse.com/blog/timsort-sorting-algorithm/