clara/immaterial-science
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

discussion and results

Browse source
This commit is contained in:
CDaut 2022-11-26 17:59:24 +01:00 • committed by CDaut
parent e5a5757b38
commit d512be9332
4 changed files with 20 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

23
Socksorting/project.tex
View file

@ -155,9 +155,26 @@ on different platforms consisting of diverse hardware:\\
\textbf{Hardware} & \textbf{Algorithm} & \textbf{Runtime [s]}\\
\hline
Myself & Conventional (n=20) & 352.7\\
\end{tabular}
Myself & \acronym (n=20) & 92.3\\
Myself & Conventional (n=100) & 42069\\
Myself & \acronym (n=100) & 420.69\\
\hline
My roommate & Conventional (n=10) & 91.7\\
My roommate & \acronym (n=10) & -2\\
\hline
Girlfriend & n.a. & n.a.
\end{tabular}\\
\begin{figure}[h]
\begin{center}
\includegraphics[width=\linewidth]{figs/graph.png}
\bigskip
\caption{Comparative statistical time analysis of both algorithms. \acronym in blue, conventional sock sorting in green.}
\end{center}
\end{figure}\\
From the above data it is evident that \acronym bears a clear advantage in comparison
to the conventional algorithm when it comes to sock sorting. Utilizing advanced statistical modelling we calculated a
speedup factor of about $2.57179072584935274050327\cdot n$. The data also illustrates
the scalability of the algorithm and its adaptability to different hardware.
\section{Conclusion}
\section{Acknowledgements}