|
@@ -102,13 +102,16 @@ Temps de cuisson : $O(n)$
|
|
% OK ComputeSignedArea
|
|
% OK ComputeSignedArea
|
|
|
|
|
|
\subsection{Slow Delaunay triangulation}
|
|
\subsection{Slow Delaunay triangulation}
|
|
-{\scriptsize\lstinputlisting{code/Delaunay.cc}} % TODO chercher algo en N (incremental flip)
|
|
|
|
|
|
+{\scriptsize\lstinputlisting{code/Delaunay.cpp}} % TODO chercher algo en N (incremental flip)
|
|
|
|
|
|
\section{Algorithmes numériques}
|
|
\section{Algorithmes numériques}
|
|
|
|
|
|
\subsection{Number theoretic algorithms (modular, Chinese remainder, linear Diophantine)}
|
|
\subsection{Number theoretic algorithms (modular, Chinese remainder, linear Diophantine)}
|
|
{\scriptsize\lstinputlisting{code/Euclid.cc}}
|
|
{\scriptsize\lstinputlisting{code/Euclid.cc}}
|
|
|
|
|
|
|
|
+\subsection{Euler's function}
|
|
|
|
+{\scriptsize\lstinputlisting{code/Euler.cpp}}
|
|
|
|
+
|
|
\subsection{Systems of linear equations, matrix inverse, determinant}
|
|
\subsection{Systems of linear equations, matrix inverse, determinant}
|
|
{\scriptsize\lstinputlisting{code/GaussJordan.cc}}
|
|
{\scriptsize\lstinputlisting{code/GaussJordan.cc}}
|
|
|
|
|