tri des codes

main.tex

@@ -74,6 +74,12 @@ Temps de cuisson : $O(n)$
 \subsection{AC Automaton}
 {\scriptsize\lstinputlisting{code/ACAutomaton.cpp}} % OK
 
+\subsection{Z-function}
+{\scriptsize\lstinputlisting{code/ZFunction.cpp}}
+
+\subsection{Hash function for string}
+{\scriptsize\lstinputlisting{code/Hash.cpp}}
+
 \section{Optimisation}
 
 \subsection{Sparse max-flow}
@@ -139,23 +145,44 @@ Temps de cuisson : $O(n)$
 \subsection{Simplex algorithm}
 {\scriptsize\lstinputlisting{code/Simplex.cc}} % OK
 
+\subsection{Binomial coefficient}
+{\scriptsize\lstinputlisting{code/Binom.cpp}}
+
 \section{Graphes}
 
 \subsection{Fast Dijkstra's algorithm}
 {\scriptsize\lstinputlisting{code/FastDijkstra.cc}}
 
+\subsection{Bellman-Ford}
+{\scriptsize\lstinputlisting{code/BellmanFord.cpp}} % OK
+
+\subsection{Floyd-Warshall (all shortest path)}
+{\scriptsize\lstinputlisting{code/FloydWarshall.cpp}}
+
 \subsection{Strongly connected components}
 {\scriptsize\lstinputlisting{code/SCC.cc}}
 
 \subsection{DFS/BFS}
 {\scriptsize\lstinputlisting{code/BFS_DFS.cpp}} % OK
 
-\subsection{Bellman-Ford}
-{\scriptsize\lstinputlisting{code/BellmanFord.cpp}} % OK
-
 \subsection{Topological Sort}
 {\scriptsize\lstinputlisting{code/TopologicalSort.cpp}}
 
+\subsection{Eulerian Circuit}
+{\scriptsize\lstinputlisting{code/EulerCircuit.cpp}}
+
+\subsection{Test Bipartite Graph}
+{\scriptsize\lstinputlisting{code/BipartiteTest.cpp}}
+
+\subsection{Cut vertex / Bridge}
+{\scriptsize\lstinputlisting{code/CutVertexBridge.cpp}}
+
+\subsection{Biconnected component}
+{\scriptsize\lstinputlisting{code/BCC.cpp}}
+
+\subsection{Exact Cover}
+{\scriptsize\lstinputlisting{code/ExactCover.cpp}}
+
 \section{Structures de données}
 
 \subsection{Suffix arrays}
@@ -179,6 +206,15 @@ Temps de cuisson : $O(n)$
 \subsection{Bits Sets}
 {\scriptsize\lstinputlisting{code/BitSet.cpp}} % OK
 
+\subsection{RMQ Offline}
+{\scriptsize\lstinputlisting{code/RMQ_offline.cpp}}
+
+\subsection{Trie}
+{\scriptsize\lstinputlisting{code/Trie.cpp}}
+
+\subsection{Rank Tree}
+{\scriptsize\lstinputlisting{code/RankTree.cpp}}
+
 \section{Divers}
 
 \subsection{Longest increasing subsequence}
@@ -190,10 +226,12 @@ Temps de cuisson : $O(n)$
 \subsection{Number of inversions}
 {\scriptsize\lstinputlisting{code/Inversion.cpp}} % OK
 
-
 \subsection{Dichotomie}
 {\scriptsize\lstinputlisting{code/Dichotomie.cpp}} % regarder
 
+\subsection{2 SAT}
+{\scriptsize\lstinputlisting{code/2SAT.cpp}}
+
 \subsection{Dates}
 {\scriptsize\lstinputlisting{code/Dates.cpp}}
 
@@ -206,47 +244,6 @@ Temps de cuisson : $O(n)$
 \subsection{Skeleton}
 {\scriptsize\lstinputlisting{code/Skeleton.cpp}}
 
-\section{Oppa Shendan Style}
-
-\subsection{Eulerian Circuit}
-{\scriptsize\lstinputlisting{code/EulerCircuit.cpp}}
-
-\subsection{Test Bipartite Graph}
-{\scriptsize\lstinputlisting{code/BipartiteTest.cpp}}
-
-\subsection{Cut vertex / Bridge}
-{\scriptsize\lstinputlisting{code/CutVertexBridge.cpp}}
-
-\subsection{Biconnected component}
-{\scriptsize\lstinputlisting{code/BCC.cpp}}
-
-\subsection{2 SAT}
-{\scriptsize\lstinputlisting{code/2SAT.cpp}}
-
-\subsection{Binomial coefficient}
-{\scriptsize\lstinputlisting{code/Binom.cpp}}
-
-\subsection{Exact Cover}
-{\scriptsize\lstinputlisting{code/ExactCover.cpp}}
-
-\subsection{RMQ Offline}
-{\scriptsize\lstinputlisting{code/RMQ_offline.cpp}}
-
-\subsection{Trie}
-{\scriptsize\lstinputlisting{code/Trie.cpp}}
-
-\subsection{Z-function}
-{\scriptsize\lstinputlisting{code/ZFunction.cpp}}
-
-\subsection{Floyd-Warshall (all shortest path)}
-{\scriptsize\lstinputlisting{code/FloydWarshall.cpp}}
-
-\subsection{Hash function for string}
-{\scriptsize\lstinputlisting{code/Hash.cpp}}
-
-\subsection{Rank Tree}
-{\scriptsize\lstinputlisting{code/RankTree.cpp}}
-
 
 \end{multicols}
 \end{document}