deletions | additions       diff --git a/GraphExplained.tex b/GraphExplained.tex  index 7524f6d..4fbccd6 100644  --- a/GraphExplained.tex  +++ b/GraphExplained.tex 
...
\subsection{Explanation of graph and values}  The benchmarks and their graphical representation correspond well to the expected results.\\ results.  Without doing any deep analysis of the data it is clear from the graph that\\ that  - with the exception of the first part of the Algo-1 results -\\ -  represent instances of the corresponding O(.) functions.\\ functions.  The oddities in the Algo-3 graph can be explained by the fact that when a\\ a  method has not been run before, it has not been Just-In-Time compiled and\\ and  thus it takes a few runs before it performs with optimal speed.\\ speed.  For the subsequent benchmarks the method seems to have been JIT compiled\\ compiled  and thus performs better than for n = 50.\\ 50.  \begin{subequations}  \textbf{When n is doubled, the time develops as follows:}