aboutsummaryrefslogtreecommitdiff
path: root/report
diff options
context:
space:
mode:
Diffstat (limited to 'report')
-rw-r--r--report/report.tex14
1 files changed, 14 insertions, 0 deletions
diff --git a/report/report.tex b/report/report.tex
index e08cc7f..bf293b5 100644
--- a/report/report.tex
+++ b/report/report.tex
@@ -232,6 +232,20 @@ and should be inserted there. This process continues until R15 which holds the i
\item Benchmark insertion-sort vs. quick-sort unsorted data
\end{itemize}
+To evaluate whether out program works, we created three \textit{shell scripts},
+one for generating test data (\textit{generate\_test\_data.sh}), one for testing
+the validity of the output of the program (\textit{test.sh}) and one for testing
+the execution time of the program (\textit{benchmark.sh}).
+
+The script that generates test files, generates files of size $n$ for all $n\in
+\{10000\cdot i \mid 0 <= i <= 10\}$ (a size of 10, means the file consists of
+10 coordinates). For each $n$ we also create three different kinds of test files. Now we can use our \textit{test.sh} script, which runs the
+program with each of the generated test files and compares the output with the
+output from the \textit{builtin} function \textit{sort}.
+
+Given all of the tests pass, we can then run \textit{benchmark.sh}, which times
+how long it takes for out program to run with each test file, and saves the
+result in a \textit{csv} file.
\begin{figure}[H]
\centering
\begin{tikzpicture}