Finish report practical 2HEADmaster

1 files changed, 6 insertions, 4 deletions

diff --git a/Practical2/report/report.tex b/Practical2/report/report.tex
index 2aeb621..96ec502 100644
--- a/Practical2/report/report.tex
+++ b/Practical2/report/report.tex
@@ -54,7 +54,7 @@
 
 \usepackage{minted}
 
-\title{How To Save Less Money Than Your CPU Costs} %todo working title
+\title{Maximising the Rounding Advantage of a Division of a List Into Sublists}
 \author{Camil Staps}
 
 \begin{document}
@@ -63,21 +63,23 @@
 \thispagestyle{fancy}
 
 \begin{abstract}
-    Given a list of $n$ numbers $a_0, a_1, \dots, a_{n-1}$, we consider one of its partitions in $k$ (possibly empty) pairwise disjoint substrings such that the sum of the sums of the substrings, rounded to multiples of $5$, is minimal.
+    Given a list of $n$ numbers $a_0, a_1, \dots, a_{n-1}$, we consider one of its partitions in $k+1$ (possibly empty) pairwise disjoint substrings such that the sum of the sums of the substrings, rounded to multiples of $5$, is minimal.
 
     This paper describes an algorithm to find the minimal sum for such a partition. It can easily be extended to find such a partition as well.
 \end{abstract}
 
 \section{Report organisation}
-\autoref{sec:notation} will define the notation used throughout this report. In \autoref{sec:algorithm} I will describe the algorithm and argue its correctness. First, we will discuss the basic structure in \autoref{sec:algorithm:general}. After that, I will show some optimisations in \autoref{sec:algorithm:optimisations}.
+\autoref{sec:notation} will define the notation used throughout this report. In \autoref{sec:algorithm} I will describe the algorithm and argue its correctness.
 
 When we have seen the algorithm, \autoref{sec:implementation} will go into details about its implementation in C. \autoref{sec:analysis} will contain a complexity analysis, both time- and space-wise, of the algorithm and its C implementation.
 
+We finish in \autoref{sec:future-work} with a discussion about possible future work.
+
 \input{notation}
 \input{algorithm}
 \input{implementation}
 \input{analysis}
-%\input{discussion}
+\input{future-work}
 
 \end{document}