report(): small refactoring

1 files changed, 9 insertions, 7 deletions

diff --git a/report/report.tex b/report/report.tex
index eeecf5a..926c9df 100644
--- a/report/report.tex
+++ b/report/report.tex
@@ -74,9 +74,11 @@ follow this strict format.
 
 \subsection{Selection of different algorithms}
 The ability to choose which algorithm to use can be quite beneficial, if you
-know certain aspects about your data. For that reason, and beause it makes
-testing different algorithms easiers, the program will be able to run with
-different algorithms passed as arguments.
+know certain aspects about your data. For example \textit{Quicksort} is very
+good with random data, but bad when the data is sorted, and
+\textit{insertionsort} is good with sorted data, but bad with random data.For
+that reason, and beause it makes testing different algorithms easiers, the
+program will be able to run with different algorithms passed as arguments.
 
 \subsection{Format when sorting}
 In order to be a little more general, and make our program easily expandable to
@@ -175,10 +177,10 @@ before printing the output.
 This four phase design has been converted into Assembly code using the x86\_64
 instruction set. Furthermore the design has been split up in modules, where each
 module is a collection of closely related functions. For example
-\textit{array\_maker.s} contains functions meant to parse data. All functions in
-this program follow the x86 calling conventions, with a few exceptions where all
-registers are preserved. Below is a detailed explanation of some of the more
-interesting functions.
+\textit{array\_maker.s} contains functions meant to parse data and convert it to
+the array format. All functions in this program follow the x86 calling
+conventions, with a few exceptions where all registers are preserved. Below is a
+detailed explanation of some of the more interesting functions.
 
 \subsection{Insertion-sort}
 This is a classic implementation of the iterative insertion-sort. The function