aboutsummaryrefslogtreecommitdiff
path: root/report
diff options
context:
space:
mode:
Diffstat (limited to '')
-rw-r--r--report/report.tex2
1 files changed, 1 insertions, 1 deletions
diff --git a/report/report.tex b/report/report.tex
index 83eee63..0a36f9a 100644
--- a/report/report.tex
+++ b/report/report.tex
@@ -270,7 +270,7 @@ one where it is reversely sorted. This way we can see both the average case, and
worst case of any algorithm we decide to use. Now we can use our
\textit{test.sh} script, which runs the program with each of the generated test
files for all sorting algorithms of the program, and compares the output with
-the output from the \textit{builtin} function \textit{sort}.
+the output from the GNU Core Utilities program \textit{sort}.
Given all of the tests pass, we can then run \textit{benchmark.sh}, which times
how long it takes for our program to run with each test file for each algorithm,