Move all presentation sources to 'src' folders, see #3

be-oi · Jul 18, 2016 · a495bd4 · a495bd4
1 parent 0ece815
commit a495bd4
Show file tree

Hide file tree

Showing 27 changed files with 19 additions and 19 deletions.
diff --git a/02-linear-struct/test_list.cpp → 02-linear-struct/src/test_list.cpp b/02-linear-struct/test_list.cpp → 02-linear-struct/src/test_list.cpp
diff --git a/08-segment-tree/segment-tree.tex b/08-segment-tree/segment-tree.tex
@@ -105,7 +105,7 @@ \section{Regular Segment Tree}
 \begin{frame}
     \frametitle{Querying implementation}
 
-    \lstinputlisting{listings/query.cpp}
+    \lstinputlisting{src/query.cpp}
 \end{frame}
 
 \begin{frame}
@@ -137,7 +137,7 @@ \section{Regular Segment Tree}
 
 \begin{frame}
     \frametitle{Building implementation}
-    \lstinputlisting{listings/build.cpp}
+    \lstinputlisting{src/build.cpp}
 \end{frame}
 
 \begin{frame}
@@ -175,7 +175,7 @@ \section{Regular Segment Tree}
 
 \begin{frame}
     \frametitle{Updating implementation}
-    \lstinputlisting{listings/update.cpp}
+    \lstinputlisting{src/update.cpp}
 \end{frame}
 
 \section{Lazy Segment Tree}
@@ -216,7 +216,7 @@ \section{Lazy Segment Tree}
 
 \begin{frame}
     \frametitle{Propagation implementation}
-    \lstinputlisting{listings/propagation.cpp}
+    \lstinputlisting{src/propagation.cpp}
 \end{frame}
 
 \begin{frame}
@@ -228,7 +228,7 @@ \section{Lazy Segment Tree}
 
 \begin{frame}
     \frametitle{Querying implementation}
-    \lstinputlisting{listings/lazy-query.cpp}
+    \lstinputlisting{src/lazy-query.cpp}
 \end{frame}
 
 \begin{frame}
@@ -250,7 +250,7 @@ \section{Lazy Segment Tree}
 
 \begin{frame}
     \frametitle{Updating implementation}
-    \lstinputlisting{listings/lazy-update.cpp}
+    \lstinputlisting{src/lazy-update.cpp}
 \end{frame}
 
 

diff --git a/08-segment-tree/listings/build.cpp → 08-segment-tree/src/build.cpp b/08-segment-tree/listings/build.cpp → 08-segment-tree/src/build.cpp
diff --git a/08-segment-tree/listings/lazy-query.cpp → 08-segment-tree/src/lazy-query.cpp b/08-segment-tree/listings/lazy-query.cpp → 08-segment-tree/src/lazy-query.cpp
diff --git a/08-segment-tree/listings/lazy-update.cpp → 08-segment-tree/src/lazy-update.cpp b/08-segment-tree/listings/lazy-update.cpp → 08-segment-tree/src/lazy-update.cpp
diff --git a/08-segment-tree/listings/propagation.cpp → 08-segment-tree/src/propagation.cpp b/08-segment-tree/listings/propagation.cpp → 08-segment-tree/src/propagation.cpp
diff --git a/08-segment-tree/listings/query.cpp → 08-segment-tree/src/query.cpp b/08-segment-tree/listings/query.cpp → 08-segment-tree/src/query.cpp
diff --git a/08-segment-tree/listings/update.cpp → 08-segment-tree/src/update.cpp b/08-segment-tree/listings/update.cpp → 08-segment-tree/src/update.cpp
diff --git a/09-fenwick-tree/fenwick-tree.tex b/09-fenwick-tree/fenwick-tree.tex
@@ -158,7 +158,7 @@ \section{How it works}
 
 \begin{frame}
     \frametitle{Query Implementation}
-    \lstinputlisting{lst/ft-query.cpp}
+    \lstinputlisting{src/ft-query.cpp}
 \end{frame}
 
 \begin{frame}
@@ -215,7 +215,7 @@ \section{How it works}
 
 \begin{frame}
     \frametitle{Update Implementation}
-    \lstinputlisting{lst/ft-update.cpp}
+    \lstinputlisting{src/ft-update.cpp}
 \end{frame}
 
 \begin{frame}

diff --git a/09-fenwick-tree/lst/ft-query.cpp → 09-fenwick-tree/src/ft-query.cpp b/09-fenwick-tree/lst/ft-query.cpp → 09-fenwick-tree/src/ft-query.cpp
diff --git a/09-fenwick-tree/lst/ft-update.cpp → 09-fenwick-tree/src/ft-update.cpp b/09-fenwick-tree/lst/ft-update.cpp → 09-fenwick-tree/src/ft-update.cpp
diff --git a/09-fenwick-tree/lst/lsone.cpp → 09-fenwick-tree/src/lsone.cpp b/09-fenwick-tree/lst/lsone.cpp → 09-fenwick-tree/src/lsone.cpp
diff --git a/11-binary-search/binary-search.tex b/11-binary-search/binary-search.tex
@@ -170,7 +170,7 @@ \section{Basic algorithm}
 
 \begin{frame}
 	\frametitle{The code}
-	\lstinputlisting{listings/binary-search.cpp} \pause \blank
+	\lstinputlisting{src/binary-search.cpp} \pause \blank
 	Complexity? $\bigoh{log(n)}$
 \end{frame}
 
@@ -200,12 +200,12 @@ \section{Other applications}
 
 \begin{frame}
 	\frametitle{The code: iterative}
-	\lstinputlisting{listings/bisection.cpp}
+	\lstinputlisting{src/bisection.cpp}
 \end{frame}
 
 \begin{frame}
 	\frametitle{The code: recursive}
-	\lstinputlisting{listings/bisection-rec.cpp}
+	\lstinputlisting{src/bisection-rec.cpp}
 \end{frame}
 
 \begin{frame}

diff --git a/11-binary-search/listings/binary-search.cpp → 11-binary-search/src/binary-search.cpp b/11-binary-search/listings/binary-search.cpp → 11-binary-search/src/binary-search.cpp
diff --git a/11-binary-search/listings/bisection-rec.cpp → 11-binary-search/src/bisection-rec.cpp b/11-binary-search/listings/bisection-rec.cpp → 11-binary-search/src/bisection-rec.cpp
diff --git a/11-binary-search/listings/bisection.cpp → 11-binary-search/src/bisection.cpp b/11-binary-search/listings/bisection.cpp → 11-binary-search/src/bisection.cpp
diff --git a/13-dynamic-programming-i/dynamic-programming-i.tex b/13-dynamic-programming-i/dynamic-programming-i.tex
@@ -100,7 +100,7 @@ \section{Motivating Problem I: Partition Problem}
 
 \begin{frame}
     \frametitle{Brute-Force solution}
-    \lstinputlisting{listings/brute-force.cpp}
+    \lstinputlisting{src/brute-force.cpp}
     \pause
     Complexity? \pause $\bigoh{3^n}$ \TLE \\\blank
     We can do better\ldots
@@ -119,7 +119,7 @@ \section{Motivating Problem I: Partition Problem}
 \begin{frame}
     What we want to do is to traverse the state graph (DFS like). \\\blank
     How can we achieve that? \pause
-    \lstinputlisting{listings/partition-problem.cpp} \pause \blank
+    \lstinputlisting{src/partition-problem.cpp} \pause \blank
     Is this enough to get \AC? \pause \textbf{No}. \\
     The graph has $ \approx n \cdot S^3 = 50 \cdot 500^3 = 6250000000$ nodes $\Rightarrow$ \MLE.
 \end{frame}
@@ -135,7 +135,7 @@ \section{Motivating Problem I: Partition Problem}
     \frametitle{State space reduction}
     Observe that at the end $ given3 = S - given1 - given2 $. \\\blank
     Thus we can drop one parameter and reduce the state space to $ n \cdot S^2 $.
-    \lstinputlisting{listings/partition-problem-better.cpp} \blank
+    \lstinputlisting{src/partition-problem-better.cpp} \blank
     This is called \textbf{State space reduction}
 \end{frame}
 
@@ -197,7 +197,7 @@ \section{Motivating Problem II: Knapsack Problem}
 
 \begin{frame}
     \frametitle{Knapsack solution}
-    \lstinputlisting{listings/knapsack.cpp}
+    \lstinputlisting{src/knapsack.cpp}
 \end{frame}
 
 \begin{frame}
@@ -376,7 +376,7 @@ \section{Motivating Problem II: Knapsack Problem}
 
 \begin{frame}
     \frametitle{Implementation}
-    \lstinputlisting{listings/knapsack-bottom-up.cpp}
+    \lstinputlisting{src/knapsack-bottom-up.cpp}
     \blank
     For most DP problems, a topological order can be achieved simply with the proper sequencing of some (nested) loops.
 \end{frame}

diff --git a/...c-programming-i/listings/562-solution.cpp → ...ynamic-programming-i/src/562-solution.cpp b/...c-programming-i/listings/562-solution.cpp → ...ynamic-programming-i/src/562-solution.cpp
diff --git a/...ic-programming-i/listings/brute-force.cpp → 13-dynamic-programming-i/src/brute-force.cpp b/...ic-programming-i/listings/brute-force.cpp → 13-dynamic-programming-i/src/brute-force.cpp
diff --git a/...ramming-i/listings/knapsack-bottom-up.cpp → ...-programming-i/src/knapsack-bottom-up.cpp b/...ramming-i/listings/knapsack-bottom-up.cpp → ...-programming-i/src/knapsack-bottom-up.cpp
diff --git a/...namic-programming-i/listings/knapsack.cpp → 13-dynamic-programming-i/src/knapsack.cpp b/...namic-programming-i/listings/knapsack.cpp → 13-dynamic-programming-i/src/knapsack.cpp
diff --git a/...g-i/listings/partition-problem-better.cpp → ...amming-i/src/partition-problem-better.cpp b/...g-i/listings/partition-problem-better.cpp → ...amming-i/src/partition-problem-better.cpp
diff --git a/...gramming-i/listings/partition-problem.cpp → ...c-programming-i/src/partition-problem.cpp b/...gramming-i/listings/partition-problem.cpp → ...c-programming-i/src/partition-problem.cpp
diff --git a/16-minimum-spanning-tree/minimum-spanning-tree.tex b/16-minimum-spanning-tree/minimum-spanning-tree.tex
@@ -374,7 +374,7 @@ \section{Kruskal's algorithm}
 \end{frame}
 \begin{frame}
 	\frametitle{Code}
-	\lstinputlisting[language=C++,firstline=52,lastline=64]{code/kruskal.cpp}
+	\lstinputlisting[language=C++,firstline=52,lastline=64]{src/kruskal.cpp}
 \end{frame}
 
 \section{Prim's algorithm}
@@ -791,12 +791,12 @@ \section{Prim's algorithm}
 \begin{frame}
 	\frametitle{Code}
 	Inside main:\\
-	\lstinputlisting[language=C++, firstline=10, lastline=19]{code/prim.cpp}
+	\lstinputlisting[language=C++, firstline=10, lastline=19]{src/prim.cpp}
 \end{frame}
 \begin{frame}
 \frametitle{Code}
 Process function:\\
-\lstinputlisting[language=C++, firstline=1, lastline=8]{code/prim.cpp}
+\lstinputlisting[language=C++, firstline=1, lastline=8]{src/prim.cpp}
 \end{frame}
 
 

diff --git a/16-minimum-spanning-tree/code/kruskal.cpp → 16-minimum-spanning-tree/src/kruskal.cpp b/16-minimum-spanning-tree/code/kruskal.cpp → 16-minimum-spanning-tree/src/kruskal.cpp
diff --git a/16-minimum-spanning-tree/code/prim.cpp → 16-minimum-spanning-tree/src/prim.cpp b/16-minimum-spanning-tree/code/prim.cpp → 16-minimum-spanning-tree/src/prim.cpp
diff --git a/16-minimum-spanning-tree/code/test.in → 16-minimum-spanning-tree/src/test.in b/16-minimum-spanning-tree/code/test.in → 16-minimum-spanning-tree/src/test.in